Longest substring identification Input: User-entered string Output: The longest substring without any repeating characters If there is a tie of the longest substring: Print the first If the length of the longest substring is less than 3: Print too small to print. Example: User enters the string character System responds with racte Problem #2: Continuing to work with substrings Input: 1. User-entered string of any length 2. An integer, n. Verification: 1. The user-entered string is at least 4 characters long. 2. Ensure that the n is a factor of the string's length Output: 1. Print the substrings of length n from the user-entered string 2. Print the substrings of length n without any duplicates. Ignore case Example: 1. User enters the string "AaBCAAADA" 2. User enters the integer 3 3. Output #1: a. AaB b. CAA C. ADA 4. Output #2: a. AB b. CA C. AD