Week 11
-------

No marks will be assigned this week.

Q0.

Practice all the problems given in the last 10 weeks and study their solutions.
Ask the TAs for help.

Q1. (For practice)

Take a string as input from the user. The string will contain only numbers
('0'-'9') and parentheses ( '(', ')' ). Your task is to find a section in the
string that matches the pattern "k(q)", where k is a single digit, q is a
substring of zero or more characters and the 2 parentheses form a matching set.
Once such a pattern is found, replace it by 'k' occurrences of 'q'. Keep doing
this till you can no longer find such patterns. Output the final string
obtained. Note that the parentheses may also be nested in the string s (see 2nd
example).

For example,
if the user inputs
12345(6)
then this will become
123466666

If the user inputs
1(2)3(4(5))
then first this should become
23(4(5))
then
23(5555)
and final output will be
2555555555555