Show how the mergesort algorithm executes on the string MATERIAL You should recall from lecture that we can use a graph to visualize the merge sort algorithm. At the very top of the graph, you have one node representing the original input list. At the very bottom, you have one node representing a sorted version of your input list. In the middle, you have nodes and edges representing the steps you take to execute merge sort. For this question, you are to execute the merge sort algorithm and show your work, with the provided string for input. You will consider each character in the input string as an element in an input list to merge sort. For example, the string "HELLO" would mean you input the list ["H", "E", "L", "L", "O"] into the merge sort algorithm.

The algorithm: –In an array of n elements, go to index [n/2] –If the record there is the one you want, you are done –If the record value there is smaller than your search value, all records less than the current record can be ignored – set your search range of elements to [n/2+1…n] and return to step 1 –Otherwise, set your range of elements to [0…(n/2)-1] and return to step 1 –Repeat this loop until you have 0 elements (record is not found) or record is found Short answer Another approach to the update algorithm is to perform use the delete function for the old value and if it is successful, call the insert function using the new value. Explain in your own words if you think this approach is significantly better, worse, or in the same category as the algorithm discussed in the slides, and why.

there are similar questions please come up with an original answer because the questions are slighty different, thank you.

Use Python Code correctly to solve this problem and also give the output.

Assume you are playing a card game using a standard 52-card deck. You are dealt a hand of cards that are all the same suit, spades. You are dealt first a 5, then a 3, then 8, and finally 4. You first took the 5 into your hand. Then you put the three before the 5. Next you put the 8 behind the 5. Finally, you put the 4 between the 3 and 5. Which sorting algorithm is most similar to how you sorted your hand?  Group of answer choices   1. Quick Sort 2. Insertion Sort 3. Merge Sort 4. Selection Sort

Consider a situation of a boarding gate of a plane where passengers are allowed to board on the place based on their age. All passengers are on a line (queue) to board on the place, however, the oldest one is always allowed to board first no matter when he/she got in the line (queue). In this case, you cannot sort the passengers by their age, however, you know that oldest ones are always at the top of the line. This is an example of a priority queue where data will be accessed and processed based on their level of priority. Suppose you need to organize such type of data so that the data in highest priority can be accessed in a constant time, O(1). What type of data structure would you use in such cases? Justify your answer.