HERE IS A BACKUP LINK IF YOU CANT READ IT: https://i.imgur.com/oeLdVfj.png

Question 3) Compute the running time of each program as a function of n and/or m (That is, n and m both show the input size, for example, you might have T(m) = 5n2 + log(n) or T(m) = 3m2 + log(m) or T(n,m) = 3m2*n + n log(n)). (35 points) YOU MUST SHOW THE NUMBER OF EXECUTIONS FOR EVERY LINE. SEE THE EXAMPLE BELOW. EXAMPLE: for i=1 to n do for i=1 to n do count++ Nurnber of Executions n+1 in 1-1)* In-111111 nn outer loop * inner loop outer loop inner loop 3-4) Program 4: count = 0 for (i=0; i