The next two questions pertain to the following: Four cities A,B,C,D are located as vertices of a square ABCD, and are connected by roads that form the four sides of the square. Mr. Rand Walker travels thus: if he is at city i (i e {A, B,C, D}) in period t, then he randomly, with probability each, moves to one of the two vertices/cities that are adjacent to i in period t +1. 31. If Mr. Walker is at city A at time t = 0 then the respective probabilities with which he is at cities A, B,C, D in period t = 10 are: A. 1/4, 1/4, 1/4, 1/4 В. 0, 1/2, 0, 1/2 С. 1/2,0, 0, 1/2 D. 1/2,0, 1/2, 0 32. If Mr. Walker is at city A at time t = 0, then what is the probability that he never visits city A again till(including) period t = 10? А. (1/2)5 В. (1/2)10 С. (3/4)* D. (3/4)10
The next two questions pertain to the following: Four cities A,B,C,D are located as vertices of a square ABCD, and are connected by roads that form the four sides of the square. Mr. Rand Walker travels thus: if he is at city i (i e {A, B,C, D}) in period t, then he randomly, with probability each, moves to one of the two vertices/cities that are adjacent to i in period t +1. 31. If Mr. Walker is at city A at time t = 0 then the respective probabilities with which he is at cities A, B,C, D in period t = 10 are: A. 1/4, 1/4, 1/4, 1/4 В. 0, 1/2, 0, 1/2 С. 1/2,0, 0, 1/2 D. 1/2,0, 1/2, 0 32. If Mr. Walker is at city A at time t = 0, then what is the probability that he never visits city A again till(including) period t = 10? А. (1/2)5 В. (1/2)10 С. (3/4)* D. (3/4)10
A First Course in Probability (10th Edition)
10th Edition
ISBN:9780134753119
Author:Sheldon Ross
Publisher:Sheldon Ross
Chapter1: Combinatorial Analysis
Section: Chapter Questions
Problem 1.1P: a. How many different 7-place license plates are possible if the first 2 places are for letters and...
Related questions
Question
Please provide a solution to both the questions given in the image 31 and 32.
Transcribed Image Text:The next two questions pertain to the following: Four cities A,B,C,D are located as vertices
of a square ABCD, and are connected by roads that form the four sides of the square. Mr.
Rand Walker travels thus: if he is at city i (i E {A, B,C, D}) in period t, then he randomly,
with probability ; each, moves to one of the two vertices/cities that are adjacent to i in
period t + 1.
31. If Mr. Walker is at city A at time t = 0 then the respective probabilities with which he
is at cities A, B,C, D in period t = 10 are:
А. 1/4, 1/4, 1/4, 1/4
В. О, 1/2,0, 1/2
C. 1/2,0, 0, 1/2
D. 1/2,0, 1/2,0
32. If Mr. Walker is at city A at time t = 0, then what is the probability that he never visits
city A again till(including) period t = 10?
A. (1/2)5
В. (1/2)10
С. (3/4)5
D. (3/4)10
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, probability and related others by exploring similar questions and additional content below.Recommended textbooks for you
A First Course in Probability (10th Edition)
Probability
ISBN:
9780134753119
Author:
Sheldon Ross
Publisher:
PEARSON
A First Course in Probability (10th Edition)
Probability
ISBN:
9780134753119
Author:
Sheldon Ross
Publisher:
PEARSON