Consider two binary operators \(\text{‘} \uparrow \text{’}\) and \(\text{‘}…

Consider two binary operators $\text{‘} \uparrow \text{’}$  and $\text{‘} \downarrow \text{’}$ with the precedence of operator $\downarrow$ being lower than that of the operator $\text{} \uparrow \text{}$. Operator $\text{} \uparrow \text{}$ is right associative while operator $\downarrow$ is left associative. Which one of the following represents the parse tree for expression $(7 \downarrow 3 \uparrow 4 \uparrow 3 \downarrow 2)$