1. Design an algorithm that lists all possible 4-digit integers made from digits 1 to 5 and are less than 5000. 2. Design an algorithm that, given a list of names, finds the longest name in the list....

1.
Design an algorithm that lists all possible 4-digit integers made from digits 1 to 5 and are less than 5000.

2.
Design an algorithm that, given a list of names, finds the longest name in the list. Use the for loop structure. Determine what your solution does if there are several “longest”

names in the list. In particular, what would your algorithm do if all the names had the same length?

3.
Design an algorithm that, given a list of nine or more names, sorts the list in alphabetical order and finds the name with the minimum number of characters.