Below is an example to similar problem. Please answer in the way that is given below. Thank You!!!

For the Job assignment problem, given the data below, find the unique job assignment for A, B, C,D that results in the most minimum cost. Derive this by applying branch and bound technique on a state space tree. Draw this tree, illustrating work. Finally list out the unique job assignment for A,B,C,D and the cost. Note: The graph (tree) that you see in Job Assignment problem Branch and Bound: Recording and corresponding pdf is called the state space tree