Consider the following program:

$$P$1$: $\{$ P$2$: $\{$

$$shared int x; shared int x;

x $=10$; x $=10$;

while $(1)\{$ while $(1)\{$

$$ x $=$ x $-1$; $$ x $=$ x $-1$;

$$ x $=$ x $+1$; $$ x $=$ x $+1$;

$$ if $($x $!=10)$ if $($x$!=10)$

$$printf$($x is $\%$d$,$x$)$ printf$($x is $\%$d$,$x$)$

$\}\}$

$\}\}$

Note the scheduler in a uniprocessor system would implement pseudo$-$parallel execution of these two concurrent processes by interleaving their instructions, without restriction on the order of the interleaving.

Show a sequence $($i$.$e$.,$ trace the sequence of interleavings of statements$)$ such that the statement $$x is $10$ is printed.