please ignore pencil scribbles

CSCI-311 Written Assignment 3 Time Analysis his assignment and write your solutions next to each problem. There are 5 problems, each is Print t worth 20 points. Problem 1 (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( al: array of integers, n: the size of the array)// 1. for int j 1,j