Three teachers x₁, x₂, x₃ teach four classes y₁, y₂, y₃, y₄ for these numbers of periods:

Show that this arrangement can be represented by a bipartite graph G and that a teaching schedule for one period corresponds to a matching in G. Set up a teaching schedule with the smallest possible number of periods.