input: Write a function to find the maximum sum of an array of non-negative integers, given an upper limit value. The function should return the maximum sum that does not exceed the given limit. If the given array is empty then return 0.
  assert findMaxSum(10, [1, 3, 5, 4, 2, 6])==9
  assert findMaxSum(5, [1, 3, 5, 4, 2, 6])==4
  assert findMaxSum(8, [1, 3, 5, 4, 2, 6])==8
  assert findMaxSum(15, [1, 3, 5, 4, 2, 6])==21
  assert findMaxSum(0, [])==0
  assert findMaxSum(10, [])==0
output: def findMaxSum(limit, arr):
      if not arr:
          return 0
      arr.sort()
      current_sum = 0
      for num in arr:
          if current_sum + num > limit:
              break
          current_sum += num
      return current_sum