Five different machines can do any of the five required jobs, and the profits resulting from each assignment are given below. Machines ABCDE Jobs 1 2 30 37 40 28 40 40 32 33 30 35 40 | 24 27 21 36 3 4 25 38 40 36 36 34 5 29 62 41 39 Find the maximum profit possible through optimal assignment. Hint: Note that this a maximization problem. To convert it into minimization problem and apply Hungarian method, subtract all the elements of the profit matrix from its highest element. Use the optimal assignments to calculate the maximum profit