Given the following algorithm, matching each statement to the correct sequence for complexity analysis.

procedure bin_exp(b, n): b and n are positive integers

1    x = 1

2    p = b

3    while (n != 0) do

4        if (n mod 2 == 1)

5            x = x * p

6        end of if

7        p = p * p

8        n = n div 2

9    end of while

a    return x

What is the decimal value of an octal number 35103510?

What is the decimal value of a hexadecimal number 744744?

What is the decimal value of an octal number 37443744?

What is the decimal value of a hexadecimal number 77AC?

Judging whether the following statement is True or False:

6|36 | 3

Finding the quotient: 46 div 9

Given a positive integer mmm and two integers aa and bb, a≡ba \equiv b (mod mm) if and only if m|(a−b)m | (a-b).

Finding the remainder: 88 mod 19