Efficiency Analysis. For each problem given below, do the following: 1. Create an algorithm in pseudocode to solve the problem. 2. Identify the factors that would influence the running time of your algorithm. For example, if your algorithm is to search an array the factor that influences the running time is the array size. Assign names (such as n) to each factor. 3. Count the operations performed by the algorithm. Express the count as a function of the factors you identified in Step 2. To do that, identify the basic operations of the algorithm. There is no need count every statement separately only the ones that will influence the running time. 4. Describe the best case scenario for the algorithm and derive the big O. 5. Describe the worst case scenario for the algorithm and derive the big 0. The problems are: 1. Determine if two arrays have no elements in common. 2. Counting the total number of characters that have a duplicate within a string, including spaces. (i. e. "gigi the gato" would result in 9 (g*3 + 1*2 + 1*2+" "*2) 3. Finding a row where every entry is 'x' in a 2-D array.