Lab 4

• Problem 1: Write a function that accepts one parameter - list of strings. The function finds and returns the position of the longest string in the list.
  
  The easy version: in case and there are several strings with maximal length, function returns one of the positions.
  
  The complex version (BONUS): function returns the list of ALL positions of the longest strings
  For example: my_list=['yana', 'bob', 'snow', 'go', 'cat', 'dogs']
  Tha maximal length is 4, and the list of positions will be [0, 2, 5]

  Write a program that generates N(user input) lists of strings. For each list, find the length of the longest string, the position of the longest string and the longest string itself using the function you wrote.

• Problem 2: Write a function def make_that has one parameter - string of characters. The function creates and returns FOUR new strings 1) the string of all lower case letters in the original string; 2) the string of all upper case letters in the original string; 3) the string of all digits in the original string; 4) the string of all other characters that are not letters or digits Write main to test your function.

• Problem 3: Write a function def pig_latin(my_str) that accepts one parameter - string of characters and returns new string based on the rules of Pig Latin slightly different that described in the book: The LAST character of the string is removed and placed at the BEGINNING of the string and the string "ay" appended to the original string. For example, if the original string is "dog", then the modified string will be: "gdoay"

  Write a function def fchange_list(string_list) that accepts one parameter - list of strings. The function converts each string to Pig Latin using function you wrote above and creates and returns a new list of Pig Latin strings. For example, if the original list was ["yana", "guy", "I"] Then the Pig Latin list will be: ["ayanay", "yguay", "Iay"]

  Write main to test your functions