Translate the C code into Pep/9 assembly code

Collatz conjecture is that if the following operation is applied repeatedly to a positive integer (N) it will eventually reach 1 If N is even, N-N/2 otherwise N-N 3+1 For example, if we start with 7, we reach 1 in 16 steps 722 11 34 17 52 26 13 40 20 10 5 169 42 1 Write and test a Pep/9 translation of the following c program. Note that variable number is unsigned so has range 0.65535. The usage of number is highlighted. tinclude Sstdio.h> int main int N counti unsigned number: scanf ("%d, &N ) ; while (N 0) while else PFintE Collatz conjecture is that if the following operation is applied repeatedly to a positive integer (N) it will eventually reach 1 If N is even, N-N/2 otherwise N-N 3+1 For example, if we start with 7, we reach 1 in 16 steps 722 11 34 17 52 26 13 40 20 10 5 169 42 1 Write and test a Pep/9 translation of the following c program. Note that variable number is unsigned so has range 0.65535. The usage of number is highlighted. tinclude Sstdio.h> int main int N counti unsigned number: scanf ("%d, &N ) ; while (N 0) while else PFintE