can u help me solve pls

Question 11 you have decided to adopt the three dogs. There are three candidates each wants to adopt any one of the dogs. After hearing from candidates about their environment, you have assigned a matching score for each candidate dog combination where a higher score indicates a potentially better match. Matching Scores dog 1 dog 2 dog 3 Candidate 1 6 en Candidate 2 1 Candidate 3 3 optimal matching can be determined via mathematical optimization. I. Develop a proper mathematical optimization formulation for this problem in closed form. The problem should maximize total matching score while matching each candidate with a dog (e.g.. CI-di. C2-d2, C3-d3) 2. Solve the formulation developed in part c via CPLEX and present the optimal result. 3. Is this problem P or NP-hard? Briefly explain