DI Graph Medium1
Coworkers Fang, Gan, Hua, Ji, and Kun must complete three new projects: a brochure, a report, and a spreadsheet. Each worker will work on exactly one
of these projects. Exactly one worker—but not Hua—will work on the spreadsheet. The coworkers' manager will not assign any workers who are close
friends to work together on a project. Lines in the graph connect two names if and only if the two Individuals are close friends.
Select from each drop-down menu the option that creates the most accurate statement, assuming the constraints described in the passage are adhered to.
could be assigned to work on the brochure, but only if Gan is assigned to work on the