Answered! A graph-theoretic problem. Seven students Benjamin (B), Donald (D), Fred (F), Julia (J), Kimberley (K), Lilian (L)…

A graph-theoretic problem. Seven students Benjamin (B), Donald (D), Fred (F), Julia (J), Kimberley (K), Lilian (L), and Monica (M) are looking for jobs after graduation. The University Placement Office has posted open positions for an architect (a), counsellor (c), economist (e), nurse (n), photographer (p), statistician (s), and translator (t). Each of the seven students has applied for some of these positions as follows: B:c, e D:a, c, p, s, t F:c, n J:c, e, n K:a, e, p, s L:e, n M:n, p, s, t Is it possible for each student to be hired for a job for which they have applied? To get full marks, your answer to this question should be clear and detailed. In particular, you are asked to explain which graph-theoretic concept can be used to model the above situation, apply this concept to the situation, and explain how the resulting graph can be exploited to answer the question.