Data Structure and Algorithms

5 Search && Sorting techniques i. Define and contrast the following search and sorting techniques: Insertion Sort, Heap Sort, Merge Sort, Quick Sort, Sequential Search, Binary Search ii. For each of the mentioned search and sorting techniques, specify the worst- case and average-case Big-Oh complexity, assuming an input array of size N (You can draw a table with a column for worst-case and average-case)