Test case 1:

Write the number of jobs: 10
Write the length of the jobs: 3 8 12 21 3 9 5 6 4 10
Write the deadlin of the jobs: 5 7 2 4 10 15 8 9 7 20
Optimal schedule by late guessing algorithm is: 3, 4, 1, 2, 9, 7, 8, 5, 6, 10, 
Maximum lateness is 61
Optimal schedule by greedy algorithm is: 3, 4, 1, 2, 9, 7, 8, 5, 6, 10, 
Maximum lateness is 61

--------------------------------

Test case 2:

Write the number of jobs: 1
Write the length of the jobs: 10
Write the deadlin of the jobs: 1
Optimal schedule by late guessing algorithm is: 1, 
Maximum lateness is 9
Optimal schedule by greedy algorithm is: 1, 
Maximum lateness is 9

------------------------------------

Test case 3:

Write the number of jobs: 5
Write the length of the jobs: 5 5 5 5 5 
Write the deadlin of the jobs: 1 1 1 1 1
Optimal schedule by late guessing algorithm is: 1, 2, 3, 4, 5, 
Maximum lateness is 24
Optimal schedule by greedy algorithm is: 1, 2, 3, 4, 5, 
Maximum lateness is 24

--------------------------------------

Evaluation guielines:

5 marks each for correct output of each test case (total is 15)
10 marks each for logical correctness of each part (total is 20)
1 marks for neat and cleanliness
2 mark for indentation
2 mark for comments

Total is 40.