Sorting

Use the following array of values to answer the following questions:

length	list	[0]	[1]	[2]	[3]	[4]	[5]	[6]	[7]	[8]	[9]	[10]
11		23	41	66	20	2	90	9	34	19	40	99

9. Show the state of the list when firstUnsorted is first set equal to the 5th item in the selection sort algorithm:

10. Show the state of the list when firstUnsorted is first set equal to the 6th item in the bubble sort algorithm:

11. Show the state of the list when firstUnsorted is first set equal to the 7th item in the insertion sort algorithm:

12. What problem-solving strategy is employed by the binary search, Quick sort, and Merge Sort algorithms?

13. What programming technique is typically used to implement the Divide and Conquer problem-solving strategy?