Question

Problem 1 (Exercise 8.3.1) Each character in a password is either a digit [0-9], lowercase letter [a-z] or special characters

{ ∗ , &​ ,​ $,#}. Compute the number of passwords that satisfy the given constraints. a) Strings of length 6 . Characters can be special characters, digits, or letters, with no repeated characters. b) Strings of length 6. Characters can be special characters, digits, or letters, with no repeated characters. The first character cannot be a special character.

Answer 1

SUGAR is not surprising to me because I don't like it because it gives me catarrh to do it for a few days ago