"Question $2($Module Outcome #$2)$: Write an algorithm in pseudocode which prints all strin XA$09$ gs of length $6$ where the first and fourth characters are any symbol from X$=\{!,$@$,$#$,$$$,\%,^\},$ the $2$nd and $6$th character is any digit in $\{0,1,2\},$ and the $3$rd and $5$th character is any digit $1,2,..\mathrm{.}9.$ How many times will the print command be called $($e$.$g$.$ how many $6-$character strings will be printed$)?$

Please show all work."