In a synchronous random access network, four terminals use a conflict resolution algorithm with a binary tree (q = 2) to access the system. All terminals are independent of each other and each one has...

In a synchronous random access network, four terminals use a conflict resolution algorithm with a binary tree (q = 2) to access the system. All terminals are independent of each other and each one has a message to transmit at the beginning of a conflict with probability p. a) Determine the maximum number of slots needed to resolve a conflict. b) What is the expected duration of the conflict resolution process in time slots? c) What is the expected duration of the conflict resolution process assuming the first time slots are consequently skipped (M0 = 2). In order for the system to perform better than the original system, which values should p lie within?