Counting Strategies: Casework, Complementary & Overcounting · Easy problem

How many shortest grid paths go from $(0,0)$ to $(3,2)$ using only steps right and up?