If we want to travel from node 1 to node 10, what is the shortest amount of time we can expect that to take given the following network? 12 6 5 4 B 7 14 10 9 10 10 3 5 3 3 B O 16 21 O 29 20 If we let xa represent project 1 and X2 represent project 2 and we say that x; and X2 are 0-1 integers (where a value of O means the project was not selected and a value of 1 means the project was selected) then the constraint written as x2 5->9, what is the expected project variance (o?)? 0.6 6.35 35.33 40.33