Problem 1 (1 points) Write a Python code to simulate one path of a simple symmetric random walk with 2N time steps (ie. lengt hofRandomwalk The function randomlalk should return an array of length 2N with the entire path of the random walk. 2N) starting at So = 0 In [ ]: I ### Insert your code here for simulating the random walk def randomlalk(lengthofRandomlalk): ## Write your own code here return samplePath