answer number 1,2 plz

Problem Sheet - Submit your Solutions if you want Feedback There are 4 questions. Question 1 Describe how you would apply (a) simulated annealing (b) a genetic algorithm to the travelling salesman problem. Question 2 Consider the following set of jobs. Produce schedules using (a) Earliest due date (b) Longest Processing Time (c) Critical Ratio and find the average tardiness. Use Moore's Algorithm to find the schedule giving the minimum number of late jobs. Job Processing Time Due Date 19 70 B 9 60 25 72 D 15 32 E 8 46 F 27 43 Question 3