The TPM of a gamblers walk consists of infinite states, so restricting over states, obtain the digraph using the sna package. Please include R CODE.

This is the gambler's walk below and a link for additional recourse

https://www.youtube.com/watch?v=zq0W-_5J-Fs&t=63s

Example 10.3.2. The 's Walk. Suppose that a gambler starts at 0 and throws a coin. If heads turn up, he takes a step to the right and moves to 1. Otherwise, he moves to the left at 1. Assume that the probability of getting a head is p, 0