Sort the given strings in alphabetical order, case **insensitive**. For example:
```
["Hello", "there", "I'm", "fine"]  -->  ["fine", "Hello", "I'm", "there"]
["C", "d", "a", "B"])              -->  ["a", "B", "C", "d"]
```

Source: codewars | Difficulty: EASY
Tags: Sorting

Data structures

Starter code: def sortme(words):
	

Solutions:
def sortme(words):
	return sorted(words, key=str.lower)


def sortme(words):
	return sorted(words, key=lambda x: x.lower())


def sortme(a):
	return sorted(a, key=str.lower)


def sortme(words):
	return sorted(words, key=str.casefold)


def lower(e):
	return e.lower()

def sortme(words):
	words.sort(key=lower)
	return words


sortme = lambda w: sorted(w, key=lambda x: x.lower())


def sortme(words):
	words_sorted = sorted(words, key=lambda s: s.casefold())
	return words_sorted


sortme = lambda words: sorted(words, key=lambda w: (w.upper(), w[0].islower()))


def KEY(n):
	return n.lower()

def sortme(words):
	words.sort(key=KEY)
	return words


def sortme(words):
	arr = []
	if len(words) > 1:
		for i in words:
			arr.append(i.lower())
		arr = sorted(arr)
		print(arr)
		m = []
		for i in arr:
			try:
				j = words.index(i)
				if i.islower():
					m.append(i)
			except:
				m.append(i.capitalize())
		return m
	else:
		return words