Question 1. Consider the cheesecake delivery problem indtroduced in the lecture notes where there are 11 nodes: 1 bakery and 10 customers (see lecture notes). a. How do you characterize a feasible solution if customers 3,5 and 8 should be visited consecutively? (the order does not matter) b. How many feasible solutions are there for part a? c. How many feasible solutions are there for the case if customers 3 and 5 should not be visited consucutively? (the order does not matter) d. Write the corresponding constraints for parts a and c