are a given number of actions that can be taken at any stage of a branch and bound algorithm for a node whose number is not specified until they are applied (the # mark). 1, BRANCH, select a node # for branching. 2. EVALUATE relaxation for node #. 3. PRUNE node # by optimality 4. PRUNE node # by bounding 5. PRUNE node # by infeasibility In addition to these, upper and lower bounds can be refined for subtree root nodes or the original root node. (a) For the following problem solving sequence, where it is assumed we are solving a maximization problem, give the action, or actions, that were taken for each of stage 1,2,3, and which actions can be taken for stage 4, Be sure to specify what node # you are applying the action to. (b) provide values for each of the ? in the tree. Stage 1 Z 55 To give an example of what is expected at each stage here are the actions for the first stage. EVALUATE 1, BRANCH 1 Stage 2 Z -? Z-? Z2 45 Z3 35 2 3 are a given number of actions that can be taken at any stage of a branch and bound algorithm for a node whose number is not specified until they are applied (the # mark). 1, BRANCH, select a node # for branching. 2. EVALUATE relaxation for node #. 3. PRUNE node # by optimality 4. PRUNE node # by bounding 5. PRUNE node # by infeasibility In addition to these, upper and lower bounds can be refined for subtree root nodes or the original root node. (a) For the following problem solving sequence, where it is assumed we are solving a maximization problem, give the action, or actions, that were taken for each of stage 1,2,3, and which actions can be taken for stage 4, Be sure to specify what node # you are applying the action to. (b) provide values for each of the ? in the tree. Stage 1 Z 55 To give an example of what is expected at each stage here are the actions for the first stage. EVALUATE 1, BRANCH 1 Stage 2 Z -? Z-? Z2 45 Z3 35 2 3