Answer Happy

Question 10 Question 2b For each of the following inputs to Insertionsort, state the runtime of the algorithm using (.) notation (no justification needed: the objective is to sort in increasing order): 1. ✓ Integer array A, of length in with A-i for every in/2. and A-n-i for every i>n/2. For example, if n-6. then A₁ -0. 1. 2. 3.2.1. 2. ✓ Integer array A, of length in with A₂=4i+6 for every 0 ≤i≤n-1. 3. ✓ Integer array A, of length in with As -1 for every i {1-3,2-n¹/³,3-n¹/³) and As-iotherwise. We assume that 1/3 is an integer here. For each question, choose from the following options: 1.0(m³) 2. (²2) 3.0(m² log²n) 4. (nlogn/log log n) 5. (logn) 6.0(n) 7.0(²) 8.(2) 9.0 (nolog) 10. (nn) 11.0(m²log n) 12. (²³) 13.0(1) 14. (n/logn) 15. (¹) 16.0(2) 17. (n/log logn) 18. (nlogn) 19. (n log²n) 20. (¹) 21. (nlog logn)