I've solved the below problem on my own and I would like to reaffirm that the work I did is correct. So please show all steps so I can compare my answer.

Problem 1. Consider an assignment problem to assign ny + n2 people to do m jobs (assuming min{n, n2} > m). The first ni people are female and the next n2 (i.e., the rest) people are male. Suppose that each job will be assigned to exactly two people with different genders and that each person can do at most one job. It costs Cij to assign person i to do jobj (i = 1, , N2 + N2; j = 1,.. , m). Formulate a model to minimize the total cost of the assignment. (15 points)