Find the schedule using graphical method to minimize the time needed to process the following jobs on the machines shown (i.e. for each machine, find the job which should be scheduled first). Also, calculate the total time elapsed to complete both jobs.

Job 1 Sequence A — B — C — D — E Time (Hrs) 2 6 5 4 7 Job 2 Sequence C — B — D — A — E Time (Hrs) 6 5 7 4 8 AppendixLO1