Random Walk

Filename:

walkLikeABel $.$m

Write a function:

$```$

function $[$finalProbabilities$]=$ walkLikeABel $($totalBlocks$,$ spaceG, fes $,$ startingB

lock $)$

where:

totalBlocks $=$ size of universe

spaceG $=$ likelihood Bel walks towards SpaceG $($lowest block$)$

fes $=$ likelihood Bel walks towards Fes $($highest block$)$

startingBlock $=$ block number Bel lives at

$```$

Bel is confused most days. Especially since he moved. He really cares more about Space G$,$ but knows that more eyes and dollars are on Fes, and so he has decided to use a random walk strategy to decide which place he will work at each day.

He has asked you to develop a function to help him understand the possibilities.

You can test with conditions like: Lives at block $4$ in a $8$ block univers. At each intersection, he has a $75\backslash \%$ likelihood he will go towards Fes and a $25\backslash \%$ likelihood that he will go towards Space G$.$

Return the stable, final probabilities for his arrival at Fes and Space $\backslash ($ G $\backslash )$ assuming Belon starts at his home.