1) Insertion Sort a) Describe its algorithm (pseudo code). b) Explain its complexity in detail. c) Use a) to demonstrate the step-by-step operations for sorting 5, 9, 1, 20, 45, 13 2) Selection Sort a) Describe its algorithm (pseudo code). b) Explain its complexity in detail. c) Use a) to demonstrate the step-by-step operations for sorting 5, 9, 1, 20, 45, 13 3) Bubble Sort a) Describe its algorithm (pseudo code). b) Explain its complexity in detail. c) Use a) to demonstrate the step-by-step operations for sorting 5, 9, 1, 20, 45, 13 6) Merge Sort a) Describe its algorithm (pseudo code). b) Explain its complexity in detail. c) Use a) to demonstrate the step-by-step operations for sorting 5, 9, 1, 20, 45, 13 6) Quick Sort a) Describe its algorithm (pseudo code). b) Explain its complexity in detail. c) Use a) to demonstrate the step-by-step operations for sorting 5, 9, 1, 20, 45, 13