input: Write a function to determine if it is possible to get an array sorted in non-decreasing order by performing a single left shift operation on the given array. If it is possible return True else return False. If the given array is empty then return True.
  
  assert can_sort_with_left_shift([3, 4, 5, 1, 2])==True
  assert can_sort_with_left_shift([3, 5, 10, 1, 2])==True
  assert can_sort_with_left_shift([4, 3, 1, 2])==False
  assert can_sort_with_left_shift([3, 5, 4, 1, 2])==False
  assert can_sort_with_left_shift([])==True
output: def can_sort_with_left_shift(arr):
      if not arr:
          return True
      n = len(arr)
      pivot = 0
      for i in range(1, n):
          if arr[i] < arr[i-1]:
              pivot = i
              break
      if pivot == 0:
          return True
      for i in range(pivot+1, n):
          if arr[i] < arr[i-1]:
              return False
      return arr[-1] <= arr[0]