Write a Mathematical report which includes mathematical notation in line with graph theory for Q$2$: All Bonkers games must have a referee, but the referee for each game cannot have any conflicts of

interest for the game. In particular, the referee cannot be a player in the game, and the referee must

also declare any other conflicts of interest $($eg$.$ cannot be a player's relative, friend, boss, etc..$).$ In

order to minimise the burden on any individual referee, the policy is to assign each referee at most one

game.

Your task is to determine a method for assigning referees to games, given the games, referees, and

conflicts of interest for each referee. You must assign at most one game to each referee, and exactly

one referee to each game, or determine that it is impossible to do so$.$

Implement your solution as a Python function of the form

def referees$($ganes$,$ refereecsvfilename$)$:

games is structured the same as in the previous question. refereecsvfilename is the name for a CSV

file which you should read to obtain the list of referees and their declared conflicts of interest. Below

is a sample CSV file showing the structure.

You may assume that for each referee there is exactly one row giving their conflicts of interest.

Your function should return a data structure of games and assigned referees similar to:

or Mone if it is not possible.