2) (15 pts) Network Flow Algorithm Design Consider the problem of assigning teachers to classes at Triple Threat University. At the university, there are three sections of each class offered, each at the same exact time. All different classes are offered at different times. Each professor the university hires has a maximum number of courses they can teach and a list of courses for which they are proficient in teaching and are available during the time period when the class is taught. (Unlike some places, Triple Threat refuses to put a teacher in a classroom for which they aren't proficient.) Given all of this data, design an efficient algorithm to determine if it is possible or not for Triple Threat University to assign professors to each of its classes. After describing your algorithm, create a small example and draw the corresponding network flow graph for that one example