Problem 3: Taken from Exercise 5 from section 8.4 of Wayne Winston Operations Research. Consider the (simplified) list of activities and predecessors that are involved in building a house. Draw a project network and determine the minimal number of days needed to build a house using the label-correcting algorithm. Exhibit a corresponding critical path. Immediate Predecessors Description Duration (Days) Activity A 5 B D Build foundation Build walls and ceilings Build roof Do electrical wiring Put in windows Put on siding Paint house 8 11 5 A B B B . E C, F E 4 6 F G 3