HOMEWORK 1: CS 425 (THEORY OF ALGORITHMS) DUE DATE: Wednesday, 01/29/2020 1. Given the following data. Illustrate Insertion Sort algorithm to sort from lowest to highest. Show each step. 36, 12, 19, 76, 16, 25,9 Also find out the total runtime. Draw a table similar to that is explained in the class, and make sufficient columns. 2. Using the pseudocode given in the class, and also in the notes, write a C++ function for Insertion Sort. Now use this function along with the main program used in Lab1, call Insertion Sort function to sort the data. 3. Given the following function f(x). Illustrate how you would compute f(10) using this function Show each step. int f(int x) if (x == 0) return 2: else return x + f(x/2); Need to understand and apply the concepts of recursive function for this. 4. Illustrate Merge Sort Algorithm to sort the following data: 26, 12, 11, 19, 30, 4, 6, 8, 17 5. Merge Sort Consists of two functions, pseudocode is given as below