(Task Scheduling Suppose that we have n tasks y physics a to schedule on a computer with a single-core processor where task i takes t time a English h; units to finish. We would like to run all of the n tasks while minimizing the e biolog th total waiting time for all tasks. Assuming that the first task starts at t = 0, the e biolog i waiting time wi for task i is the total time before it is started. For example, if algebra th we have three tasks with execution times ty = 5, t2 = 3, and tz = 2 scheduled to run in the order (C1,C2, C3), the waiting times are wi = 0, W2 = 5, and e biology li uz = 5+3 = 8. If they are scheduled in the order (C3,C2,C), the waiting times algebra th become wz = 0, w2 = 2, and wj = 2 + 3 = 5. e biolog th e biology Propose a greedy algorithm that finds the optimal scheduling algebra h for the n tasks with the minimum waiting time. e biolog li Establish the running time of your algorithm. algebra E th e biolog th Prove the optimality of your algorithm. e biolog lish math science biology physics math algebra English math science biology physics math algebra