Question 2: Suppose there are n jobs and n workers. The cost paid to worker i to do job j is Ci,j. Each job is performed by only one worker and vice versa. Find a way to hire workers so that the total cost is minimal. Use design techniques to write algorithms to solve the above problem.
Question 3: Given a square grid of level n, each cell is assigned a natural number. At a cell, you can move to another cell in the following directions: down, to the right (the next cell next to the bottom and to the right). Find the path from the first cell (1,1) to the cell (n,n) such that the sum of the cells passing through is minimal. Design an algorithm to solve this problem.
Please help me solve these 2 questions!
Thank you so much