Using the following programming language grammar for language $L$ rules, generate a

parse tree for the given expressions:

::$=gcd(,)|**|-|$

$()|x|y|z$

$($a$),gcd((x^{**}z),(x-y))$

$($b$),((z-x)+y)$