Problem 7 Random walk with absorbing boundary In the page rank algorithm, we removed pages containing no inks. We did this because once that pages is visited by our random link follower, they get stuck on that page forever. In Markov chain parlance, a state i such that P[Xt+1=iXt=i]=1 is callod an absorbing state. Assume we have a random walk as in examples 485 but make the boundary absorbing Le. once a boudary point is reached we remain in that state for every subsequent step. Othervise, we move to the left or right 1 unit distance with equal probability. For K=25 create the transition matrix and assign it to a variable called Q7. As before, full credit is obtained by avoiding doing a lot of work by hand. i. I Code cell for Problen 7 - do not modify or delete this line 07= \#Print cell for Problem 7 - do not modify this cell, do execute this cell print (07) print(np.5um(07))