Study the given array Numbers = {45, 30, 10, 50, 31} to answer the below questions. a) Show a step by step, how array Numbers can be sorted using insertion sort algorithm in descending order. [4] b) Differentiate how bubble sort algorithm and selection sort algorithm works. [4] c) Explain how Exponential Search algorithm works and write the algorithm in pseudocode. Include the parameters, pre-condition, and post-condition in the pseudocode. d) Write a java binary search method to search for 35 in the given array. [5] e) Which search algorithm works better between Linear search and Jump search. Explain your [2] [5] answer. f) Write the merge sort algorithm in pseudocode. [5] QUESTION 3 a) Write a java code snippet of a recursive Fibonacci series function to determine the value of any given position in the Fibonacci series. [4] b) The Factorial recursive function, Factorial(n), determines the factorial of any number. Show a recursion trace of how the function finds Factorial(3). [4]