Problem 5. Quick Sort Sort 3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5 using quicksort when the pivot is chosen as the first element

Python program named "YourMuseumID_Exhibits.py" focusing on museum exhibit data: You have a list of dictionaries representing exhibits in a museum. Each dictionary contains the exhibit name, the number of artifacts on display, and the historical era it covers. Perform the following tasks: (a) Calculate and display the total number of artifacts on display for all exhibits in the museum. (b) Identify and display the exhibit with the highest number of artifacts on display. (c) Implement a function that takes a user-input exhibit name and searches for it in the list. If found, display the number of artifacts on display and the historical era it covers; if not found, print a message indicating that the exhibit is not in the museum. (d) Implement a sorting algorithm of your choice to sort the exhibits based on the number of artifacts on display in descending order and display the sorted list. Make sure to incorporate functions for each task and display the results in the main function with…

How often should you use a binary search approach as opposed to a sequential one?

Quick Sort is an in-place algorithm. True False

If you applied Selection Sort to all the users on Facebook, approximately how long would it take for the algorithm to find the specific user? a-years b-weeks c-days

Which sort usually requires fewer data values to be swapped, bubble sort or selection sort?

Don't give me AI generated answer or plagiarised answer. If I see these things I'll give you multiple downvotes and will report immediately.

Which algorithm design approach employs selection sort? Why?

Manually use the different sort methods to sort the sequence given below.  please explain in detail.  23,35,12,14,72,61,24,8,12 a) bubble sort  b) selection sort  c) insertion sort  don't use code use diagrams and show manually for part a, b and c

Data: 45,30,50,25,60,55,75,70 From the data, do the sorting using 1. Selection sort method 2. Insertion sort method