I need help solving this problem

(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 T of the algorithm using big-O notation Assume that all elements of array a are less than or equal to n. void do_something( all: array of integers, n: the size of the array)// 1. for intj 1,jn, jt+ Ilignore these operations 2. barray of size j //takes constant time to declare an array for int k = 1.k