input: Write a function to determine if it is possible to get a list of integers sorted in non-decreasing order by performing any number of circular left shift operations on the given list. If it is possible return True else return False. If the given list is empty then return True.
  assert circular_sort_possible([3, 4, 5, 1, 2])==True
  assert circular_sort_possible([3, 5, 10, 1, 2])==False
  assert circular_sort_possible([4, 3, 1, 2])==False
  assert circular_sort_possible([3, 5, 4, 1, 2])==False
  assert circular_sort_possible([])==True
output: def circular_sort_possible(arr):
      if not arr:
          return True
      count = 0
      for i in range(len(arr)):
          if arr[i] < arr[i-1]:
              count += 1
      return count <= 1