Strength Checker for Password Systems: For a given password system, calculate the search space for a...

Transcribed Image Text:

Strength Checker for Password Systems: For a given password system, calculate the search space for a general user and a lazy user. Suppose only 11 special characters can be input. Program with any language. Input (by the evaluator): 1st line: number of characters 2nd line: numbers allowed [Y/N]? must be included [Y/N]? 3rd line: letters allowed [Y/N]? case sensitive [Y/N]? must be included [Y/N]? 4th line: special character allowed [Y/NJ? must be included [Y/NJ? Output: 1st line: The search space for a general user is 0. 2nd line: The search space for a lazy user is ). Example: Input: 6 YY YYY YY Output: The search space for a general user is 1.43*10^11. The search space for a lazy user is 2.68*10^9. in java code Strength Checker for Password Systems: For a given password system, calculate the search space for a general user and a lazy user. Suppose only 11 special characters can be input. Program with any language. Input (by the evaluator): 1st line: number of characters 2nd line: numbers allowed [Y/N]? must be included [Y/N]? 3rd line: letters allowed [Y/N]? case sensitive [Y/N]? must be included [Y/N]? 4th line: special character allowed [Y/NJ? must be included [Y/NJ? Output: 1st line: The search space for a general user is 0. 2nd line: The search space for a lazy user is ). Example: Input: 6 YY YYY YY Output: The search space for a general user is 1.43*10^11. The search space for a lazy user is 2.68*10^9. in java code

Answer rating: 100% (QA)

Answer Step 1 Program Approach Import necessary packages to get a standard IO Define a main class Inside a main class define a main function Inside a main function make use of scanner class to read in... View the full answer