Bipartite Graphs and Matchings · Superchallenge problem

Over all bipartite graphs with $|X|=|Y|=4$ where every vertex of $X$ has degree EXACTLY $2$ (but $Y$'s degrees may vary), what is the SMALLEST possible size of a maximum matching? (A graph where all of $X$ can be matched would give $4$.)