Check all true statements.

Expressed in base$-$n$,$ the integer n is $"10".$

In duodecimal $($base $12),$ every digit is $0,1,2,3,4,5,6,7,8,9,A$ or B $.$

You can convert a number from binary to octal by grouping the digits $("$bits$")$ of the binary number into groups of $3,$ going from right to left. If the number of bits is not a multiple of $3,$ you may have to add one or two leading $0$ bits on the left side. Then you convert each group of $3$ bits into one octal digit.

You can convert a number from decimal to binary by replacing each decimal digit separately by its corresponding binary representation.

The security of Diffie$-$Hellmann Key Exchange is based on the difficulty of computing discrete logarithms.

The fast modular exponentiation algorithm takes advantage of the binary representation of the exponent.

You can convert a number from hexadecimal to binary by replacing each hexadecimal digit separately by its corresponding $4-$bit binary representation.

The fast modular exponentiation algorithm computes $b^n$ mod $m$ in only about $lo{g}_2(n)$ steps. This makes it practical even when $n$ is large.

Given a positive integer $n$ and a base $b,$ we can find the last digit of the base $b$ expansion of $n$ by performing the division algorithm to find $n=bq+r.$ The remainder $r$ is the last digit. By repeating the process with $q$ instead of $n,$ we find the next digit, and so on$.$

Expressed in base$-$n$,$ the integer $n^2$ is $"100".$

In base $b,$ it is easy to see whether an integer is a multiple of $b.$ Its last digit is zero in that case.

Among all base $b$ representations of a positive integer n $,$ the binary one is always at least as long as any other $($in terms of number of digits.$)$

In ternary $($base $3),$ every digit is a $0,1$ or $2.$

In octal $($base $8),$ every digit is $0,1,2,3,4,5,6$ or $7.$

If $k$ is an integer greater than $1$ and $n$ is a positive integer that is not a power of $k,$ then $n$ has $|$~$lo{g}_k(n)$~$|$ digits in base $k.$