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.

)because it's going in order of the math sign

At a constant it will take one hour to travel 32 mi.at that speed it will take 1/2 hr to travel the remaining 16 mi.it will take 1+1/2 hr to travel the 48mi @ 32mph.so 1 hr = 60 min& 1/2 hr = 30 min1+1/2 hr = 90 min.there are 60s in each 90 × 60 = 3600 seconds.the real question seriously is he why are they driving so slow? ! lol.