not too sure where to start.Code:/** Random walk problem statement: ------------------------------ Simulate the walk of a drunkard in a square street grid. Begin with a simulated inebriated person in the middle of the grid. Label this beginning point the origin (0,0). At each street intersection, the drunkard randomly chooses the direction to walk, that is east, west, north or south. After 100 such random decisions, what distance, measured in units of the grid or city blocks, has the drunkard traveled? Measure the distance using the distance formula for the x-y plane. Repeat the above simulation 10 times. Report the average and the median distance traveled in the 10 simulations. */ //prototype the function double random_walk(); int main() { //call the random_walk() function 10 times return 0; } //implement the function //simulate the random walk, of 100 choices double random_walk() { }