Scheduling

Create a scheduling algorithm for a central SQL server that responds to database queries from many different clients. The queries can only be run one at a time, but can be run in any order. We know in advance what the queries are and what their running times will be. We want to choose how to schedule query such that the overall waiting time is minimized. The *waiting time* of a query is how long it must wait in a queue before it is executed. For example, if the running times of the queries are (2, 5, 1, 3) and we schedule the queries in that order, then the total waiting time is 0 + (2) + (2+5) + (2+5+1) = 17. If we scheduled them in the reverse order, then the total waiting time is 0 + (3) + (1+3) + (5+1+3) = 16, which is slightly better. However, the minimum possible waiting time for this example is 10. Implement the function scheduling(times), which is given a list of query times and returns the optimal (minimum) total waiting time. EXAMPLES scheduling([2, 5, 1, 3]) # 10 scheduling([3, 4, 4, 4, 4, 2]) # 46 scheduling([3, 1, 4, 3]) # 12 scheduling([7, 3, 7, 3, 3, 1]) # 39 scheduling([2, 6, 2, 6, 3, 6]) # 45 And use this to start the code: def scheduling(times): pass