Can anyone help me solve this problem? I am so confusing.

Consider a ring of size n nodes and each edge of length 1. Assume that two mobile agents each with a tolen (the tokens are identical); they start at distance d from each other and can change speeds from 1 node per unit time to 2 nodes per unit time. 3 1. leave token at starting node; 2. choose CCW direction and walk; 3. repeat until rendezvous; (a) 1st time you meet token change speed to 2; (b) 2nd time you meet token change speed to 1; Now answer the following questions: 5 pts] What condition between d, n ensures rendezvous? 2. [5 pts] How long does it take to rendezvous as a function of d,n Consider a ring of size n nodes and each edge of length 1. Assume that two mobile agents each with a tolen (the tokens are identical); they start at distance d from each other and can change speeds from 1 node per unit time to 2 nodes per unit time. 3 1. leave token at starting node; 2. choose CCW direction and walk; 3. repeat until rendezvous; (a) 1st time you meet token change speed to 2; (b) 2nd time you meet token change speed to 1; Now answer the following questions: 5 pts] What condition between d, n ensures rendezvous? 2. [5 pts] How long does it take to rendezvous as a function of d,n