Consider the following pseudo-code.

L1: t1 = -1

L2: t2 = 0

L3: t3 = 0

L4: t4 = 4 * t3

L5: t5 = 4 * t2

L6: t6 = t5 * M

L7: t7 = t4 + t6

L8: t8 = a[t7]

L9: if t8 <= max goto L11

L10: t1 = t8

L11: t3 = t3 + 1

L12: if t3 < M goto L4

L13: t2 = t2 + 1

L14: if t2 < N goto L3

L15: max = t1

Which one of the following options CORRECTLY specifies the number of basic blocks and the number of instructions in the largest basic block, respectively ?

i. There exists a statement $${S_j}$$ that uses x

ii. There is a path from $${S_i}$$ to $${S_j}$$ in the flow graph corresponding to the program

iii. The path has no intervening assignment to x including at $${S_i}$$ and $${S_j}$$

The variables which are live both at the statement in basic block 2 and at the statement in basic block 3 of the above control flow graph are

```
(1) i = 1
(2) j = 1
(3) t1 = 5 ∗ i
(4) t2 = t1 + j
(5) t3 = 4 ∗ t2
(6) t4 = t3
(7) a[t4] = -1
(8) j = j + 1
(9) if j<=5 goto (3)
(10) i=i+1
(11) if i<5 goto (2)
```

The number of nodes and edges in the control-flow-graph constructed for the above code, respectively, are