Consider a programming language in which there are no rules of precedence and only the

associativity rule is specified from right to left.

Show the order of evaluation of the following expressions by parenthesizing all sub$-$expressions

and placing a superscript on the right parenthesis to indicate order. For example, for the

expression with the $a,b,c$ and $d$ operands

$a+b**c+d$

the order of evaluation would be represented as

$(a+(b**(c+d{)}^1{)}^2{)}^3$

a$)a**b-1+c$

b$)a**\frac{b-1}{c}$modd

c$)\frac{a-b}{c}$&$(d**\frac{e}{a}-3)$

d$)-a$ or $c=d$ and $e$

e$)a>b$ xor $c$ or $d17$

f$)-a+b$