The following algorithm

step $1$: x$0$ :$=$ x; j :$=0$

step $2$: while xj $=0,$ do

aj :$=$ remainder of integer divide xj $/2$

xj$+1$ :$=$ quotient of integer divide xj $/2$

j :$=$ j $+1$

end while

can be used to convert a positive decimal integer x to its binary equivalent,

x $=($anan$1$ a$1$a$0)2.$

Implement the algorithm $($write a computer program$).$ Print your code and include it to

your submission. Apply it to convert the following integers to their binary equivalents:

$($a$)27$

$($b$)2845$

The Matlab library functions rem, mod, floor, num$2$str$,$ fliplr might be helpful when

you use Matlab