Let$$s solve this problem by using the branch and bound algorithm with best$-$first search

using the exact algorithm described during the lecture. Answer the following questions

using the portion of the pruned state space tree shown below.

a$)(10$ pts$)$ Show how the bound at the root node is computed