EASY PYTHON – A drunkard in a grid of streets randomly picks oneof four directions and stumbles to the next intersection, thenagain randomly picks one of four directions and so on. You mightthink that on average the drunkard doesn’t move far because thechoices cancel each other out but this is not the case. Representlocations as integer pairs (x,y). Implement the drunkard’s walkover 100 intersections, starting at (0,0) and printing the endlocation
Expert Answer
An answer will be send to you shortly. . . . .