Design a contextfree grammar CFG for the following language
     Design a context-free grammar (CFG) for the following language  Please briefly describe the strings derived by each variable of your grammar  L = {a^i b^j  | i lessthanorequalto j lessthanorequalto 3i, i greaterthanorequalto 0, j greaterthanorequalto 0} 
  
  Solution
S -> aSb | aSbb | aSbbb |
Example strings

