Problem 8.33. You start at x = 0 and at step i you can move up or down i. So a possible path is 0,1,3,0, 4. (a) Prove that every n e N can be reached. (b) Let T(n) be the minimum number of steps to reach n. Prove that T(n)