You use the pattern "1+2+3+...+n".
For a) "n" is 20, so it's 1+2+3+...+20 which is 210.
For b) split it up into 2 parts, the amount of routes from A to C multiplied by the amount of routes from C to B.
So from A to C, let "n" be 3, so 1+2+3 = 6
From C to B, let "n" be 5, so 1+2+3+4+5 = 15
Hence 6 times 15 = 90 possible routes from A to B through C.
Will do others now.