I need help with problem 5 Use the Binary Search Algorithm t

I need help with problem 5?

Use the Binary Search Algorithm to determine whether the number 17 appears in the sequence s: 3, 6, 7, 8, 15, 17, 19, 23, 24. Give a step description of what the algorithm does in this case. Use the Binary Search Algorithm to determine whether the number 11 appears in the sequence s: 2, 4, 5, 7, 9, 10, 12, 14, 15, 16, 19, 23. Give a table that presents a step by step Give a step description of what the algorithm does in this case. Use the bubble sort Algorithm on the sequence s: 11, 9, 10, 8 so that the terms are recorded from smallest to largest. Give a table that presents a step by step description of what the algorithm does in this case. Use the bubble sort Algorithm on the sequence s: 3, 9, 7, 6, 5 so that the terms are reordered from smallest to largest. Give a table that presents a step by step description of what the algorithm does in this case. Write a new Bubble sort Algorithm that sorts the terms of a sequence s: a_1, a_2, ..., a_n of n numbers so that the terms of s are reordered from largest to smallest. Sort the list s: 6, 4, 2, 1, 3, 5 by the insertion sort Algorithm. Give a diagram that presents a step by step description of what the algorithm does in this case. Write a new Insertion Sort Algorithm that sorts the terms of a sequence s: a_1, a_2, ..., a_n of n numbers so that the of s are reordered from largest to smallest. Indicate how the two sorted lists s_1: 1, 3, 4, 7, 8, 9 and s_2: 2, 5, 6 are merged into a single sorted list by the Merge Sort Algorithm.

Solution

for largest to smallest, just we need to change if logic shown below

output will be