Prove the reflection principle: The number of paths or a (simple symmetric) random walk of length IN such that So = a > 0, Sy = b > 0 and S, = 0 for at least on n in {0, ..., N} equals the number of all paths such that So = -a and SN = b