Python please

2. Suppose we have n people to assign to n jobs, one person per job (one-to-one and onto). The matrix C[i,j], each cell of which is occupied by a positive integer value, determines the cost of assigning the ith person to the jth job. An optimal algorithm will minimize the total cost. Design your own greedy algorithm for the problem and prove that it is optimal or prove that it is not optimal. Explain why your algorithm is a "greedy" algorithm. Here is an example matrix of costs: Person Job 1234 1 9278 2 6437 3 5 818 4 7694 2. Suppose we have n people to assign to n jobs, one person per job (one-to-one and onto). The matrix C[i,j], each cell of which is occupied by a positive integer value, determines the cost of assigning the ith person to the jth job. An optimal algorithm will minimize the total cost. Design your own greedy algorithm for the problem and prove that it is optimal or prove that it is not optimal. Explain why your algorithm is a "greedy" algorithm. Here is an example matrix of costs: Person Job 1234 1 9278 2 6437 3 5 818 4 7694