Please solve this question by explaining step by step.

If your solution is clear and understandable UPVOTE.

Consider P3 | brkdwn,M; | Cmax with 8 jobs. Jobs 1 10 2 10 3 7 4 7 5 7 6 7 7 7 8 7 Pi Machines 1 and 2 are available continuously. Machine 3 is not available during the interval [0, 1]; after time 1 it is available throughout. The M; sets are defined as follows: M] = {1,3} M2 = {2,3} M3 = M4 = M5 = {1} ME=M7 = Mg = {2} Use the following rules to find a schedule. (1) LPT rule: give priority to the longest job that can be processed on the machine freed. (2) LFJ rule: give priority to the least flexible job while disregarding processing times. (3) Compute the ratio Cmax(LPT)/Cmax(LFJ). Consider P3 | brkdwn,M; | Cmax with 8 jobs. Jobs 1 10 2 10 3 7 4 7 5 7 6 7 7 7 8 7 Pi Machines 1 and 2 are available continuously. Machine 3 is not available during the interval [0, 1]; after time 1 it is available throughout. The M; sets are defined as follows: M] = {1,3} M2 = {2,3} M3 = M4 = M5 = {1} ME=M7 = Mg = {2} Use the following rules to find a schedule. (1) LPT rule: give priority to the longest job that can be processed on the machine freed. (2) LFJ rule: give priority to the least flexible job while disregarding processing times. (3) Compute the ratio Cmax(LPT)/Cmax(LFJ)