Consider the following context-free grammar over the alphabet Σ= (a, b, c} with .S as the start symbol: S-> a.bScT I abcT, T->bT I b Which one of the following represents the language generated by the above grammer?