A RFID reader is using the binary tree algorithm. Answer the following questions:

a$)$ The counter of each tag determines when it transmits. True$/$false$?$

b$)$ If multiple tags have a counter value of zero, then there will be a collision. True$/$false$?$

c$)$ If there is a collision, tags add one to their counter. What happens to the reading rate $($tags read per second$)$ if we double the counter value instead? i$.$e$.,$ this is similar to the backoff process of CSMA. Explain.

Fill in the $Q$ value for the following table for $C=0\mathrm{.}1,$ and $C=0\mathrm{.}5.$ Explain the impact of the value of $C$ on the tag reading rate. Assume we round to the nearest integer; e$.$g$.,$ round$(1\mathrm{.}8)=2$ and round $(1\mathrm{.}2)=1,$ and round $(1\mathrm{.}5)=2.$ Note that $Q$ has an initial value of $4.$

$\backslash$table$[[$Query #$,$Number of Responses,$\backslash$table$[[$Q Value$],[)=(0\mathrm{.}1$