Q5. A. Consider the following single machine-scheduling problem with weights: + Job (j) Processing time (t) 1 2 3 4 5 16 4 5 Weight, wj 2 1 3 12 2 9 3 Determine the sequence, which will minimize the weighted mean flow time of the above problem. Also find the weighted mean flow time. B. Consider the following single machine-scheduling problem. Job (j) Processing time (t) 1 2 3 4 5 15 4 5 14 8