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?

Asecurity policy is a a. set of guidlines b. set of transmission protocols c. written document d. set of rules based on standards and guidelines

Scanning the road can be thought of as a

Write a program that has a conversation with the user. the program must ask for both strings and numbers as input. the program must ask for at least 4 different inputs from the user. the program must reuse at least 3 inputs in what it displays on the screen. the program must perform some form of arithmetic operation on the numbers the user inputs. turn in your .py file as well as a screenshot of your program's output. include comments in your code to explain how it works an example program run might look like (have fun with this and be creative): ‘what is your name? ’ “josh” ‘, josh. what is your favorite color? ’ “green” ‘mine too. do you also like ice cream? ’ “no” ‘josh, how old are you? ’ “40” ‘ and how many siblings do you have? ’’ “3” ‘that means you are one of 4 kid(s). is green the favorite color of anyone else in your house? ’