(1) Count the exact number of basic operations at line 4 executed during running of the given algorithm. (2) Express the running time T of the algorithm as the sum of all basic operations. (3) Express the running time of the algorithm using big-o notation. Assume that all elements of array a are less than or equal to n. void do something( a[]: array of integers, n: the size of the array) // 1. for int j = 1, j