olve the instancemax 17𝑥1 + 10𝑥2 + 25𝑥3 + 17𝑥45𝑥1 + 3𝑥2 + 8𝑥3 + 7𝑥4 ≤ 12𝑥 ∈ {0, 1}4by branch-and-bound. Always branch first on the node with the bestbound. You must number the nodes as you explore them. Name1the first node as “Root”. Create a table with one row for each node.At each row, indicate the value of the variables in the solution ofthe node, the capacity used, the profit of the solution (or indicateits infeasibility) and the status associated with the node (branched,pruned by infeasibility, pruned by integrality or pruned by quality).

Find a highest sumGiven a binary tree in which each node element contains a number. Find the maximum possible path sum from one special node to another special node.Note: Here special node is a node that is connected to exactly one different node.Constraints:2  ≤  Number of nodes  ≤  104-103  ≤ Value of each node ≤ 103Sample input3 4 5 -10 4Sample output16

Question1Max. score: 10.00Find a highest sumGiven a binary tree in which each node element contains a number. Find the maximum possible path sum from one special node to another special node.Note: Here speci

The maximum number of nodes in acomplete binary tree i

Which of the following problems is solved by using Branch and Bound method?ans.prim's algorithmBFSDFStravelling salesman problem

Where is the maximum number in a binary search tree? a) At the root of the tree. b) Anywhere other than root and leaf nodes c) At the leftmost leaf node. d) At the rightmost leaf node