Suppose a distributed system is implemented with the Raymond's tree-based algorithm for mutual exclusion, and the current tree configuration is shown below with Site B being the token holder. (Recall in the Raymond's tree structure, each node maintains a Holder variable to record its current parent node and a request queue Req_Q to record requests that the node has received but is still awaiting the token for.)

Suppose further, that Process E wishes to enter CS right after Process G has sent out its request for CS. Fill in the table below in chronological order changes to the Req_Q and Holder variables in the given sites as request is made and each message is being transmitted in order to enable the requested CS to be executed. In the Event column, give a brief description of event that causes the update of data structure(s). The symbol “” in the table below means “empty”.