Please do statement execution count for this problem. both best and worse case

3-4 Perform a statement execution count for the following algorithm. Show the number of statements executed by cach line. For this pseudocode on line 2, the first execution of outer loop is with a value of 1, the last execution is with a value of n, and then there is an additional test to terminate the loop. The while statement on line 4 is like the C++ while statement with the test at the top of the loop. Evaluate all the summations for both the best case and the worst case, and write each total as a polynomial in n. 2 count = 0 for i = 1 to n do j = 0 while j