Question 2 (module outcome #2): write an algorithm in pseudocode which prints all strings of length 6 where the first and fourth characters are any symbol from x={! ,@,#,$,%,^}, the 2nd and 6th character is any digit in {0,1,2}, and the 3rd and 5th 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)?