[Q3] [25 POINTS] Describe A dictionary attack can be augmented to try orthographic substitutions, such as 2 for z and @ for a. Assume a common dictionary has 100,000 words and ( to make calculations easy), all letters are lower case and the 26 letters are evenly distributed( that is, "a" occurs exactly 1/26 of the time as does "z"). How many extra substitute word possibilities are there, allowing @ for a? (That is, attack would try the word "bay" and also"b@y"). If there are ten such orthographic substitutions (2 for z, @ for a, 1 for 1, 6 for b, $ for s, ect), how many word possibilities would an attacker need to try?