Can anyone translate this C code into Pep/9 assembly language please?

Collatz conjecture is that if the following operation is applied repeatedly to a positive integer (N) it will eventually reach 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 168 421 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. include int main) int N, count; unsigned number scanf ("%d%, &N) ; while N!-0) number-M; eount- 0; while (number !- (number%2.01 if else number number 31 count+ number number2: printf("%d steps ",count); scanf ("%d", &N) ; printt "Goodbye ) Your program should check for overflow where appropriate. Collatz conjecture is that if the following operation is applied repeatedly to a positive integer (N) it will eventually reach 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 168 421 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. include int main) int N, count; unsigned number scanf ("%d%, &N) ; while N!-0) number-M; eount- 0; while (number !- (number%2.01 if else number number 31 count+ number number2: printf("%d steps ",count); scanf ("%d", &N) ; printt "Goodbye ) Your program should check for overflow where appropriate