using the input of $137641$solve the following: Procedure PROCX: You are given a sequence of digits x as input. You will return a sequence of digits as output. Group the digits in x into pairs starting from the right. $($If x has an odd number of digits, the leftmost group will only have a single digit in it$.)$ Initialize u$,$ v$,$ bot, top, and side all to $0.$ Process each group from left to right in the following steps: a$.$ Set bot to $($bot $-$ u$)^($next group from x$).$ b$.$ Set side to $2\backslash$times top. c$.$ Set v to the largest single digit such that v $\backslash$times $($side$^$v$)<=$ bot. d$.$ Set u to v $\backslash$times $($side$^$v$).$ e$.$ Set top to top$^$v$.$ The answer to return is the final value of top.