Consider the following definitions for sets of characters: digits = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} letters = {a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z} special characters = {*, & , $, #} compute the number of passwords that satisfy the given constraints. answer questions with big number answers as powers or sum of powers (ex: 15%^7 instead of 170, 859, 375) strings of length 6. characters can be special characters, digits, or letters. strings of length 7, 8, or 9. characters can be special characters, digits, or letters. strings of length 7, 8, or 9. characters can be special characters, digits, or letters. the first character cannot be a letter 4) strings of length. strings of length 6 characters can be special characters, digits, or letters, with no repeated characters. you will not be able to answer this with as a power or sum or powers) strings of length 6. characters can be special characters, digits, or letters, with no repeated characters the first character cannot be a special character.