I have this function and i want to know hoy to have the operations, worse, better and average cases per line and finally how to get the T(n) and finally the asymptotic quotevoid Algoritmo1(int a[]) {    int i, j, temp;                 (1)    for (i=1; i < n; i++)               (2)    {        for (j=n; j > i; j--)           (3)        {            if (a[j-1]>a[j])            (4)            {                temp = a[j-1];          (5)                a[j-1] = a[j];          (6)                a[j] = temp;            (7)            }                           }                           }                       }
Algorithms from their asymptotic dimensions for worse, better and average cases
algorithms;asymptotics