Question $1.$ Consider the cheesecake delivery problem indtroduced in the lecture noteswhere 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 bevisited consecutively $($the order does not matter$)$ and customers $1$ and $2$ must notvisit consecutively?b$.$ How many feasible solutions are there for part a$?$c$.$ Write the corresponding constraints for parts a and a$.$