Consider the following algorithm that finds a row where every entry is x in a 2-D array. Assume that (a) the array has n rows and m columns, and that (b) the comparison on line 3 counts towards the running time. 1 FOR every row in the array
2 FOR every column in the array
3 IF [row][column] == 'x' THEN
4 IF column is the last THEN
5 DISPLAY found row
6 ENDIF
7 ELSE
8 move on to the next row
9 ENDIF
10 ENDFOR
11 ENDFOR
1 What is the best case scenario?
2 What is the exact number of operations for the best case scenario in terms of n and m?
3 What is the big-oh for the best case scenario?
4 What is the worst case scenario?
5 What is the exact number of operations for the worst case scenario in terms of n and m?
6 What is the big-oh for the worst case scenario?