You are given the following JavaScript function:

Question $3.$A: Complete the Program Execution Tree $($PET$)$ for this function. In the PET, nodes

represent conditional statements and edges correspond to sequences of statements executed

based on the condition. Use $\text{'}t\text{'}$ for true branches and $\text{'}f\text{'}$ for false branches. Alongside each edge,

note any variable assignments that occur. Use a small square symbol $($e$.$g$.,)$ to indicate leaf

nodes where execution ends. The tree should clearly display all potential execution paths based

on the conditions in the code.

Question $3.$B: Based on the Program Execution Tree you developed in $3.$A$,$ each path through

the program corresponds to a unique condition set, known as path conditions. For each path

leading to a leaf node in your PET, write down the path condition. A path condition is a logical

expression that describes the specific conditions under which the program takes that execution

path. Use standard logical symbols $($e$.$g$.,{?}^{{?}^{?}}$ for AND, not for NOT$)$ to express these conditions.