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