input: Write a python function to determine if the number of inversions between two sets are equal.
  assert solve([1,0,2],3) == True
  assert solve([1,2,0],3) == False
  assert solve([1,2,1],3) == True
output: def solve(seq, n):
      def count_inversions(arr):
          inv_count = 0
          for i in range(len(arr)):
              for j in range(i + 1, len(arr)):
                  if arr[i] > arr[j]:
                      inv_count += 1
          return inv_count
      
      original = list(range(n))
      original_inversions = count_inversions(original)
      seq_inversions = count_inversions(seq)
      
      return original_inversions == seq_inversions