DRUNK WALK The program should be developed on Google Colab in Phyton Language Minimum requirements: 1. The program should simulate the walk of a drunkard through a Random Walk Discrete (Random Walk) 2. N random paths should be generated, with M steps and with probability p 3. The parameters N, M and p must be input data 4. The Bbado starts walking in position 0 and, with each step, goes upwards (+1) with probability p, or down (-1) with probability (1-p) 5. Students must have a non-linear cost function, which must be applied at each step and be based on the position of the drunk. Total cost should be reported as the sum of the costs generated at each step 6. Students must have a non-linear cost function, which must be applied to the final position of the drunk. The cost should be reported 7. At the end of the generation of the M paths, the basic statistics referring to the position of the drunk should be displayed (average position, minimum position, maximum position, variance, number of times the position has returned to 0) 8. At the end of the generation of the M paths, the basic statistics referring to the value of the functions created in items 5 and 6 must be presented (minimum, maximum, average, variance) It is desirable that: 1. The program returns a graph with the generated paths (Position x Step) 2. The program returns a graph with the accumulated costs generated by the function of item 5 for the generated paths (Position x Step) 3. The program should have a histogram graph of the position, total cost of item 5, cost of item 6