Question 2 i) Develop a well-documented pseudo code that finds the two consecutive elements in the array with the smallest difference in between, and the two consecutive elements with the biggest difference in between. The code must display the values and the indices of these elements. For instance, given the following array [20, 52,400, 3, 30, 70, 72, 47, 28, 38, 41, 53, 20] your code should find and display something similar to the following (notice that this is just an example. Your solution must not refer to this particular example.): The two conductive indices with smallest difference between their values are: index 5 and index 6, storing values 70 and 73. The two conductive indices with largest difference between their values are: index 2 and index 3, storing values 400 and 3. In case of multiple occurrences of the smallest or largest differences, the code should display the first found occurrence. ii) Briefly justify the motive(s) behind your design. iii) What is the time complexity of your solution? You must specify such complexity using the Big-O notation. Explain clearly how you obtained such complexity. iv) What is the maximum size of stack growth of your algorithm? Explain clearly