from collections import Counter

def mostCommonName(names):
    name_count = Counter(names)
    most_common = name_count.most_common()
    max_count = most_common[0][1]
    most_common_names = {name for name, count in most_common if count == max_count}
    return most_common_names if most_common_names else None

def isPalindromicList(a):
    return a == a[::-1]

def indexOfSmallestElement(lst):
    if not lst:
        return None
    min_element = min(lst)
    return min(i for i, x in enumerate(lst) if x == min_element)