c++ assignment . I only need the ansers to question number 2, 6,8, 10.Please give me the correct answers.

currently added to veatist. (4) , Consider the following list 45, 78, 23. 12, 63. 90. 38. 6. . 15 Using a sequential search, how many comparisons are determine whether the followi required to at i ng items are in the list or not? (Recall th risons mean item comparisons, not index comparisons.) (1) b.14 d 23 5 90 c.45 Write a version of the sequential search algorithm that can be used to search a sorted list. (1) 4Consider the following list: 5, 26, 38, 41. 49. 56, 62. 68, 88, 95, 100, 125, 145 Using a sequential search on ordered lists, that you designed in Exercise 3, how many comparisons are required to determine whether the following items are in the list or not? (Recall that comparlsons mean item comparisons, not index comparisons.) (1) Sort the following list using the bubble sort algorithm as discussed in this chapter. Show the list after each iteration of the outer tor loop. (2) 50, 36, 78, 40, 4, 28, 90, 62, 22 Sort the following list using the bubble sort algorithm as discussed in this chapter. Show the list after each iteration of the outer for loop. (2) 82, 17, 40, 28, 15, 55, 46, 93, 6. 67, 11, 3 Consider the following list: 12, 25, 30, 38, 28, 90, 56 . The first four keys are in order. To move 28 to its proper position using the insertion sort algorithm as described in this chapter, exactly how many key comparisons are executed? (2) Consider the following list: 8, 14, 40, 52, 60, 65, 2, 90, 23 The first six keys are in order. (2)