input: def extract_odd_numbers_collatz(n):
      """
      Provided a positive integer n, return an ordered list of odd numbers found in the Collatz sequence.
  
      The Collatz hypothesis in mathematics describes a sequence initiated with any positive integer n. 
      Each subsequent term is determined according to these rules: if the previous term is even, the 
      next term is half of the previous term. If the previous term is odd, the next term is three times 
      the previous term plus one. The hypothesis suggests that regardless of the starting value of n, 
      the sequence invariably reaches 1.
  
      Note: 
          1. Collatz(1) results in [1].
          2. The returned list should be sorted in ascending order.
  
      For example:
      extract_odd_numbers_collatz(5) yields [1, 5] # The collatz sequence for 5 is [5, 16, 8, 4, 2, 1], thus the odd numbers are 1 and 5.
      """
output:     
      collatz_sequence = []
      
      while n != 1:
          collatz_sequence.append(n)
          if n % 2 == 0:
              n = n // 2
          else:
              n = 3 * n + 1
  
      collatz_sequence.append(1)  # Add the last term of sequence which is 1
  
      odd_numbers = [x for x in collatz_sequence if x % 2 != 0]
      return sorted(odd_numbers)
  