input: Write a python function to determine the largest product obtainable by multiplying elements of an increasing subsequence within an array.
  assert max_product([3, 100, 4, 5, 150, 6], 6) == 45000 
  assert max_product([4, 42, 55, 68, 80], 5) == 50265600
  assert max_product([10, 22, 9, 33, 21, 50, 41, 60], 8) == 21780000
output: def max_product(arr, n):
      if n == 0:
          return 0
  
      dp = arr[:]
      for i in range(1, n):
          for j in range(i):
              if arr[i] > arr[j]:
                  dp[i] = max(dp[i], dp[j] * arr[i])
  
      return max(dp)