Bipartite Graphs and Matchings · Superchallenge problem

$X=\{1,2,3,4\}$ and $Y=\{a,b,c,d\}$ are joined by every edge of $K_{4,4}$ except $1a,2b,3c,4d$ (the "crown" graph). How many different MINIMUM vertex covers does this graph have?