$7.$ The following shows two processes sharing a common variable $\backslash ($ X $\backslash ).$

Before the two processes are executed, X is $5,$ and the statements described for each process are executed sequentially, and there is no assumption about the execution order of processes $\backslash ($ A $\backslash )$ and $\backslash ($ B $\backslash ).[3$ points$]$

$(1)$ When the two processes are completed, write down the execution order of the processes $($the execution order of $\backslash (\backslash$mathrm$\{$A$\}1,\backslash$mathrm$\{$~A$\}2,\backslash$mathrm$\{$~B$\}1,\backslash$mathrm$\{$~B$\}2\backslash ))$ and all possible values that the variable X can have.

$(2)$ If the following binary semaphore variable S is used, and before two processes are executed, S is $1$ and X is $5,$ write down all the execution orders of the processes and the possible values that the variable $\backslash ($ X $\backslash )$ can have when the two processes are finished executing.

$\backslash [$

$\backslash$text $\{-\}10\backslash$text $\{-\}$

$\backslash ]$

$(3)$ If a binary semaphore variable $\backslash ($ T $\backslash )$ is used as follows, and before two processes are executed, $\backslash ($ T $\backslash )$ is $0$ and $\backslash ($ X $\backslash )$ is $5,$ write down all the execution order of the processes and the possible values that the variable X can have.

$```$

$//$Process $0$

int Y;

A$1$:Y $=$ X$*2$;

A$2$:X $=$ Y

A$3$:SemSignal$($T$)$;

$```$

$```$

$//$Process $1$

int Z;

B$1$:SemWait$($T$)$;

B$2$:Z $=$ X$+1$;

B$3$:X $=$ Z;

$```$