(a) Consider the problem of scheduling n jobs of known durations t, t2, ..., In for execution by a single processor. All the n jobs arrive at the same time, i.e. time 0. The jobs can be executed in any order, one job at a time. Evaluate the problem by presenting a greedy algorithm solution that finds a schedule to minimize the total waiting time of the n jobs. You may present the solution using a pseudocode. [10 marks]