$2.(\backslash (\backslash$mathbf$\{30\}\backslash )$ pts$)$ Write an ARM Cortex M$3$ assembly code that compares two ASCII character strings to understand which follows the other in alphabetical ordering. Both strings should have the same length as defined by the LENGTH variable held in R$2.$ The starting addresses of the strings are defined by the START$1$ and START$2$ variables. If the string defined by START$1$ is greater than or equal to the other string, clear the GREATER variable held in R$1$; otherwise set it to $0$xFFFFFFFF$.$ Show how your code executes step$-$by$-$step using line comments.

Example: After execution of test cases: A R$1\backslash (=0\backslash$times $0000000\backslash ),$ for $\backslash ($ B R $1=0\backslash$times $0000000\backslash ),$ for $\backslash ($ C $\backslash )$ R$1\backslash (=0$ x F F F F F F F $\backslash )$