1. The assignment problem is to assign n people to n jobs so that the total cost of the assignment is as small as possible. Consider the following instance of the assignment problem.

	Job 1	Job 2	Job 3	Job 4
	9	3	8	9	Person a
C=	7	5	4	8	Person b
	6	9	2	9	Person c
	8	7	9	5	Person d

1. Trace the backtracking algorithm to find an optimal assignment.
2. Trace the best-first branch-and-bound algorithm with the bounding function based on matrix columns. (Note: The textbook solves the problem with the bounding function based on matrix rows).