For Strategy-1, write the LP formulation that was solved at every 5th node. (d) Strategy-1: - Node Selection: Best First Select the node with the best objective function value. - Variable Selection: Nearest to integer A fractional variable with fractional value nearest to an integer will be used for branching. - Branching Direction: Up Select the branch of side (lower bound is increased.) (e) Strategy-2: - Node Selection: Depth First the Best Back Select the most recently created child node to solve. If no child exists, then backtrack to the best bound node available in the entire tree. - Variable Selection: Lowest fraction A fractional variable with lowest fraction will be used for branching. - Branching Direction: Down Select the branch of side (upper bound is decreased.) (f) Strategy-3: - Node Selection: Breadth First the Best Next All nodes at one level of the search tree are processed before any node at a deeper level. In a given level, best node should be processed first. - Variable Selection: Highest fraction A fractional variable with highest fraction will be used for branching. - Branching Direction: You are free to pick any rule: For Strategy-1, write the LP formulation that was solved at every 5th node. (d) Strategy-1: - Node Selection: Best First Select the node with the best objective function value. - Variable Selection: Nearest to integer A fractional variable with fractional value nearest to an integer will be used for branching. - Branching Direction: Up Select the branch of side (lower bound is increased.) (e) Strategy-2: - Node Selection: Depth First the Best Back Select the most recently created child node to solve. If no child exists, then backtrack to the best bound node available in the entire tree. - Variable Selection: Lowest fraction A fractional variable with lowest fraction will be used for branching. - Branching Direction: Down Select the branch of side (upper bound is decreased.) (f) Strategy-3: - Node Selection: Breadth First the Best Next All nodes at one level of the search tree are processed before any node at a deeper level. In a given level, best node should be processed first. - Variable Selection: Highest fraction A fractional variable with highest fraction will be used for branching. - Branching Direction: You are free to pick any rule