* A Java programmer begins walking aimlessly. * At each time step, she takes one step in a random direction (either north, east, south, or west), * each with probability 25%. She stops once she is at ...

Given a positive integer 'n', find and return the minimum number of steps that 'n' has to take to get reduced to 1. You can perform any one of the following 3 steps: 1.) Subtract 1 from it. (n = n - ...