This question is from the subject Design and analysis of algorithm.

Do not copy and paste some text on the internet. Request to solve the question, answer the sub-questions clearly in your book, and paste photos.

I will like your genuine work

FAKE experts stay away

(a) Draw the portion of the state space tree generated by Loast Cost Branch and Bound (LCBB) for the following 0/1 knapsack instances: n44,(p1,p2,p3,p4)=(12,10,20,15),(w1, w2,w3,w4)=(2,1,3,2), Compare the computation time of FIFO BB and LCBB, M=5 (5M)