Break these functions

# 1. Should return how many times the list goes up
#    from one value to the next.
def count_rises(a):
    count = 0
    for i in range(1, len(a) - 1):
        if a[i] > a[i - 1]:
            count += 1
    return count

# 2. Should return True if the list is in order.
def is_sorted(a):
    return len(a) == 0 or a[0] <= a[-1]

# 3. Should return the index of the first place where
#    the largest value appears (the list is not empty).
def first_max_index(a):
    best = 0
    for i in range(len(a)):
        if a[i] >= a[best]:
            best = i
    return best

# 4. Should return the second largest different value
#    (the list has at least two different values).
def second_best(a):
    return sorted(a)[-2]

Wider than the screen: swipe sideways to see the rest.