Question 1: (5 Points) (This question can be solved in 10 minutes easily) a) (Write Yes or No as your answer) We may need to search more even if we found an integer feasible solution. Is it correct? b) (Write Yes or No as your answer) Do we create offspring nodes by branching and continue to search from a parent node at the search tree of BnB algorithm if there is no variable which is limited by only integer values in the MIP model but not integer valued at the solution of the LP model in the parent node? c) (Write Yes or No as your answer) We do not need to search more if there are some nodes at the search tree that branching is needed. Is it correct? d) (Write Yes or No at the end) Is the model that we solve in the root node an LP model? e) (Write Yes or No as your answer) Do we create offspring nodes by branching and continue to search from a parent node at the search tree of BnB algorithm if infeasible solution is obtained as the solution of the LP model in the parent node