How many paths are there from A to B in the following diagram if only moves downward are allowed?https://cdn.artofproblemsolving.com/attachments/f/d/62a14f7959cc0461543b0f76bba51be9786847.png<spanclass=′latex−bold′>(A)</span>65<spanclass=′latex−bold′>(B)</span>67<spanclass=′latex−bold′>(C)</span>70<spanclass=′latex−bold′>(D)</span>74<spanclass=′latex−bold′>(E)</span>75