Please follow the instructions and provide answers to the question

My proposed term project is called "OptiRoute" and it is a routing optimization tool for delivery companies. The tool will take in a list of deliveries, each with their own addresses and specific delivery times, and output the most efficient route for a delivery driver to take in order to finish all of the deliveries on time. The tool will incorporate divide and conquer techniques in order to efficiently find the optimal route.

The sorting component of OptiRoute will sort the list of deliveries based on the specific delivery time and priority level. The sorted list will then be used to find the most efficient route for the delivery driver.

1. Provide sorting algorithm code that will produce an output if run

2. choose one sorting algorithm for code implementation (quicksort, timsort or Radixsort ) and explain why you chose specific algorithm over others

3. Draw UML class diagram for sorting