Data Structure

Could you add some explanations for each step, please? Thank you for your help in advance.

24. (10 points) Suppose you are storing the list of data values date={1,2,3,4,3,6,7,8} and you adopt a move-to-front reorganization stratesy so that sequential searching on the list is improved. Show the final configuration of the data list after the valus below are scarched for (in the ordier shown). 4,3,5,4,2,6,4,1,3,7,3 25. Consider running the Quicksort algorithe ot the array A below (as we have stulied it). Show tbe values in the array A after the first partitioning step. 26. Suppose you are setting up a cloecd hash table with an optitnal hashing function and optimal collision policy (no clustering, equal probabilities for each open slot). You initially dedicate M=3000 for the size of the table. How many records can the table coetain (N=?) before you can expect that inserting new records will require a total of 2.5 probes on average