Part (i)
2 marksSince there are endpoints A–I, every journey from S to an endpoint passes through exactly junctions, and at each junction the bug independently takes the left fork (probability ) or the right fork (probability ). Finishing at the -th endpoint from the top (A being , I being ) requires exactly right forks and left forks among these junctions — moving one letter further down the row for each extra right fork taken.
D is the th endpoint, so reaching D requires exactly right forks and left forks. By independence of the junctions, any one such route has probability , and the number of such routes is the number of ways to choose which of the junctions are the right forks, .
Part (ii)
4 marksLet be the probability that the bug finishes at the -th endpoint from the top, so
D is ; its immediate neighbours are C () and E ().
Approach
Comparing with gives the ratio , which is strictly decreasing in . This means the sequence increases and then decreases (it has a single peak), so it is enough to check that exceeds its two neighbours C and E — this then guarantees exceeds every other endpoint’s probability as well, without checking each one individually.
Comparing D with C:
We need , i.e. :
Comparing D with E:
We need , i.e. :
| To check your answer: at , exactly, and at , exactly — the two boundary values recovered directly by setting each ratio equal to . ✓ |
the possible range of values of is .
Part (iii)
1 markAt each of the junctions, independently of the other junctions, the bug either continues along a fork (probability ) or is swallowed by the black hole (probability ). The bug reaches one of the endpoints A–I if and only if it survives all junctions.
Explanation: reaching an endpoint at all does not depend on which endpoint, only on never being swallowed, so the fork probabilities and do not appear in the answer — only their combined survival probability at each junction matters.
.