Consider a stringsthat contains a pair of matching parentheses with zero or more characters between the parentheses. Examples of such strings include:

'()' 'a(bcd)efg' 'The professor (and her research assistant) solved an important problem.' 'x + ((y + z) / 2) * 10' 

Notice that the last example string contains a pair of nested parentheses.

Write a recursive functionget_enclosed(s)that returns the part of the stringsthat is enclosed by the outermost pair of matching parenthesesincluding the parentheses. For each of the example strings shown above your function should return the following strings:

'()' '(bcd)' '(and her research assistant)' '((y + z) / 2)' 

Your function does not need to handle strings where there are two or more pairs of matching parentheses that are not nested. Examples of such input strings that you can ignore are:

'(*^-^)(^-^*)' 'a(bcd)(efg)hij(klm)' '(x + y) * (y + z)' 

Finally, if the string does not contain a matching pair of parentheses then your function should return the empty string''. Examples of such input strings include:

`(` `)` `abcdefghi` `abc[def]ghi`