Bipartite Graphs and Matchings · Medium problem

Five applicants $1,2,3,4,5$ apply to jobs $a,b,c,d$ as follows: $1$ and $2$ qualify only for $a$; $3$ qualifies for $a$ or $b$; $4$ qualifies for $b$ or $c$; $5$ qualifies for $c$ or $d$. What is the maximum number of applicants who can be simultaneously placed into distinct jobs?