find and replace algorithm Consider the following pseudocode: Input: An array A = (a1, a2, ..., an) of n numbers. 1. For j = 2 to n 2. key - A[i] 3.1-j-1 4. While i 0 and A[i] > key 5. A[i+1] - A[i] 6. i-i-1 7. A[i+1] - key 1. Show the iterations step-by-step of the pseudocode for the instance A = (41, 11, 7, 18, 3). 2. Describe the inputs, outputs and the computational problem that the pseudocode solves. 3. What is the computational complexity of the pseudocode? Is it an efficient algorithm or not? Discuss in detail