2. Recall problem 1 from homework 2: You wish to build a house and you have divided the process into a number of tasks, namely: B. excavation and building the foundation, F. raising the wooden frame, E. electrical wiring, P. indoor plumbing, D. dry walls and flooring, and L. landscaping. You estimate the following duration for each of the tasks (in weeks): Some of the tasks can only be started when some other tasks are completed. For instance, you can only build the frame once the foundation has been completed, i.e. F can start only after B is completed. All the precedence constraints are summarized as follows: - F can start only after B is completed, - L can start only after B is completed, - E can start only after F is completed, - P can start only after F is completed, - D can start only after E is completed. - D can start only after P is completed. The goal is to schedule the starting time of each task such that the entire project is completed as soon as possible. As an example, here is a feasible schedule with a completion time of ten weeks. Implement this problem as an IP in Python/PuLP. Report the optimal solution in your write-up. Does this solution adhere to all the constraints