How do you solve the optimal assignment problem for the following array by solving two dual problems? Also, how many optimal solutions are there for the array and why?
J1 | J2 | J3 | J4 | J5
P1| 2 | 3 | 4 | 3 | 5
P2| 1 | 3 | 2 | 1 | 3
P3| 3 | 5 | 2 | 3 | 3
P4| 4 | 4 | 2 | 1 | 4
P5| 3 | 1 | 4 | 4 | 3