Given the following grammar, derive the string " A 2 B C 3 ". In every step of derivation, write the rule number on top of the derivation arrow. Draw the parsing tree.
[ N={<𝐈>,<𝐋>,<𝐃>}; T={A, B, C, 1,2,3}; P= the productions ]
1. <𝐈>-><𝐋> 2. <𝐈>-><𝐈><𝐋> 3. <𝐈>-><<𝐈><𝐃> 4. <𝐋>->A 5. <𝐋>-> B 6. <𝐋>->C 7. <𝐃>-> 1 8. <𝐃>-> 2 9. <𝐃>-> 3
S=<𝐈>