3. Consider the program graph depicted in figure shown below. It has four program points and operates on a variable that can take integer values among $0,1,2$ and 3 only. For readability we shall write the states $\langle q, n angle$ simply as $q n$ where the first component gives a program point (chosen among $a, b, c, d)$ and the second component gives the value of a variable (chosen among $0,1,2,3$ ). $$ \begin{aligned} \mathrm{S} &=\{q n \mid q \in\{a, b, c, d } \wedge n \in\{0,1,2,3}\} \mathrm{I} &=\{a 0, a 1, a 2, a 3\} \mathrm{AP} &=\left\{@_{a}, @_{b}, @_{c}, @_{d}, \#_{0}, \#_{1}, \#_{2}, \#_{3}, \triangleright, 4 ight\} \end{aligned} $$ $2 / 3$ a) Define the labeling function by setting (for $n \in\{0,1,2,3\}$ ) b) Define and illustrate the transition relation $ ightarrow$ cs.vs. 1005 3. Consider the program graph depicted in figure shown below. It has four program points and operates on a variable that can take integer values among $0,1,2$ and 3 only. For readability we shall write the states $\langle q, n angle$ simply as $q n$ where the first component gives a program point (chosen among $a, b, c, d)$ and the second component gives the value of a variable (chosen among $0,1,2,3$ ). $$ \begin{aligned} \mathrm{S} &=\{q n \mid q \in\{a, b, c, d } \wedge n \in\{0,1,2,3}\} \mathrm{I} &=\{a 0, a 1, a 2, a 3\} \mathrm{AP} &=\left\{@_{a}, @_{b}, @_{c}, @_{d}, \#_{0}, \#_{1}, \#_{2}, \#_{3}, \triangleright, 4 ight\} \end{aligned} $$ $2 / 3$ a) Define the labeling function by setting (for $n \in\{0,1,2,3\}$ ) b) Define and illustrate the transition relation $ ightarrow$ cs.vs. 1005