input: Write a Python function that accepts a list of integers of even length and performs the following operations n/2 times: remove the smallest and largest elements, compute their average, and store it in a list. Finally, return the smallest average computed.
  
  def find_minimum_average(nums: List[int]) -> float:
      """
      You are given a list of integers where the length of the list is even. 
  
      The function performs the following steps n/2 times where n is the length of the list:
      - Removes the smallest and largest integers from the list.
      - Computes the average of these two integers.
      - Stores the average in a separate list.
  
      Ultimately, the function returns the smallest value from the list of computed averages.
  
      Examples:
      >>> nums = [7,8,3,4,15,13,4,1]
      5.5
      >>> nums = [1,9,8,3,10,5]
      5.5
  
      Constraints:
      - The length of the list is between 2 and 50, inclusive.
      - The list length is even.
      - Each integer in the list is between 1 and 50, inclusive.
      """
output: def find_minimum_average(nums: List[int]) -> float:
      averages = []
      while len(nums) > 0:
          smallest = min(nums)
          largest = max(nums)
          nums.remove(smallest)
          nums.remove(largest)
          averages.append((smallest + largest) / 2)
      return min(averages)