Write a subroutine called PACK that accepts an arbitrary number of arguments. The arguments are always stored after the BSA instruction in the following order:

ArgLoc, Arg $1,$ Arg $2,$ Arg $3,......$ Arg N$,-1$

Where arguments Arg $1$ thru Arg $N$ are random locations of memory, each location containing one character in the lower $8$ bits of the location, while the higher $8$ bits are all zeros. Assume $N$ is always even and is always at least $2.$

The value $-1($decimal$)$ denotes the end of arguments.

ArgLoc is the first argument, and it denotes the starting location in memory where the characters need to be stored consecutively, $2$ characters in each location.

Examples:

Assume the memory looked like this before BSA executes.

$\begin{array}{cc}\text{A}\text{d}\text{d}\text{r}\text{e}\text{s}\text{s}& \text{C}\text{o}\text{n}\text{t}\text{e}\text{n}\text{t}\\ 088& {?}^{\text{'}}A\\ \text{d}\text{o}\text{t}\text{s}& ?\\ 096& {?}^{\text{'}}F\\ \text{d}\text{o}\text{t}\text{s}& ?\\ 09A& {?}^{\text{'}}T\\ \text{d}\text{o}\text{t}\text{s}& ?\\ 0A3& ?\\ \text{d}\text{o}\text{t}\text{s}& ?\\ \text{O}\text{B}\text{B}& ?\\ 0BC& ?\end{array}$