Outcome #$2)$:

a$.)$ Write an algorithm in pseudocode which prints all strings of length $6$ where the first three characters are any symbol from X$=\{$@$,$#$,$$$,\%\},$ the $4$th character is any digit $0,1,2,3,$ and the last two characters are any digit $1,2,..\mathrm{.}8.$

b$.)$ How many times will the print command be called $($e$.$g$.$ how many $6-$character strings will be printed$)?$