Qus $(3.$a$)$ In a machine scheduling example of three machines and $10$ jobs, the jobs

times are given as follows:

$\left[\begin{array}{cccccccccc}26& 05& 77& 01& 61& 11& 59& 15& 48& 19\end{array}\right]$

Find the processing time with random possible schedule discussed in the class

$($b$))$: Find the processing time with largest processing time $($LPT$)$ first schedule

discussed in the class.

$3($e$)$: What did you observe in the timing distributions of these two schedules? What

is the time complexities of the schedules for a $n$ number of jobs and $m$ number of

machines?

$(15$ Marks$)(4-5$ Pages$)$