Would like to see code on this problem, I am having trouble getting the turtle to go in a random path. Thanks!

*1 1.36 (Simulation using Turtle: self-avoiding random walk) A self-avoiding walk in a lattice is a path from one point to another that does not visit the same point twice. Self-avoiding walks have applications in physics, chemistry, and mathematics They can be used to model chainlike entities such as solvents and polymers. Write a Turtle program that displays a random path that starts from the center and ends at a point on the boundary, as shown in Figure 11.1la, or ends at a dead-end point (i.e., surrounded by four points that have already been visited), as shown in Figure 11.11b. Assume the size of the lattice is 16 X 16 FIGURE I1.1I (a) A path ends at a boundary point. (b) A path ends at dead-end point