discrete math subject: kindly solve this correctly please i want to compare with my solution

5. A bicyclist is going from A = (, 0) to B = (31 4). She is only allowed to go north and east on the one-way streets. See gure below. (a) How many paths are there for the bicyclist going from A to B? [2p) (b) Let us now allow for diagonal moves such that (I, y) > (53+ 1, y + 1) is possible. How many paths are there now for the bicyclist going from A to B if she uses at least one diagonal move? (3;!)