input: Write a python function that identifies the sublist with the greatest number of elements.
  assert find_longest_sublist([[0], [1, 3], [5, 7], [9, 11], [13, 15, 17]]) == (3, [13, 15, 17])
  assert find_longest_sublist([[1], [5, 7], [10, 12, 14, 15]]) == (4, [10, 12, 14, 15])
  assert find_longest_sublist([[5], [15, 20, 25]]) == (3, [15, 20, 25])
output: def find_longest_sublist(lst):
      if not lst:
          return (0, [])
      max_length = 0
      longest_sublist = []
      for sublist in lst:
          if len(sublist) > max_length:
              max_length = len(sublist)
              longest_sublist = sublist
      return (max_length, longest_sublist)