1)Trace a walkthrough of insertion sort with these lists: a. 4 7 11 4 9 5 11 7 3 5 b. 7 6 8 7 5 9 0 11 10 5 8

2)Trace a walkthrough of: a. Linear search for 7 in 7 1 3 3 4 7 11 13 b. Binary search for 8 in 7 2 2 3 4 7 8 11 13 c. Binary search for 8 in 7 1 2 3 5 7 10 13

3)Why does insertion sort perform significantly better than selection sort if an array is already sorted?