Show me the steps to solve True or false, We have $20$ new students arriving at the dorm. Each dorm room has a capacity of $2.$ If we have the ratings for how compatible each pair of students are $($ratings between $1$ to $10),$ then for solving the matching problem that maximizes the total rating, we do not need to enforce binary constraints; the optimal solution will automatically be binary.