Consider the canonical $L R(0)$ parsing of the grammar below using terminals $\{a, b, c\}$ and non-terminals $\{A, B, C, S\}$ with $S$ as the start symbol.

$$ \begin{aligned} & S \rightarrow A C B \\ & A \rightarrow \alpha A \mid \in \\ & C \rightarrow c C \mid \in \\ & B \rightarrow b B \mid b \end{aligned} $$

Which one of the following options gives the number of shift-reduce conflicts that will occur in the $L R(0)$ ACTION table?

Consider the control flow graph given below.

Which one of the following options is the set of live variables at the exit point of each basic block?

Consider a file of size 4 million bytes being transferred between two hosts connected via a path consisting of three consecutive links of bandwidth $2 \mathrm{Mbps}, 500 \mathrm{kbps}$, and 1 Mbps , respectively. All processing delays and propagation delays are negligible. Assume that there is no other background traffic over the path and no other additional overhead to transfer the file.

Which one of the following is the total time (in seconds) to transfer the file?

Note: $1 \mathrm{M}=10^6, 1 \mathrm{k}=10^3$

Which one of the following protocols may need to broadcast some of its messages?