In other words, a Markov chain is a tree process if for every pair of distinct states i and j there is a unique way for the process to go from i to j without reentering a state (and this path is the reverse of the unique path from j to i). Argue that an ergodic tree process is time reversible.

Find the value of p for which the polynomial 3x^3 -x^2 + px +1 is exactly divisible by x-1, hence factorise the polynomial

Solve the equation below: (x+4)/6x=1/x a. x=2 b. x=0,2 c. x=-2 d. x=0,-2

Type the correct answer in each box. spell all words correctly. a sequence of transformations maps ∆abc onto ∆a″b″c″. the type of transformation that maps ∆abc onto ∆a′b′c′ is a . when ∆a′b′c′ is reflected across the line x = -2 to form ∆a″b″c″, vertex of ∆a″b″c″ will have the same coordinates as b′.