Develop a Python program that takes in a single-dimensional array as a parameter, and returns the number of subsets with size 3 or greater.
arr = [1, 2, 3, 4, 5]
def find_subsets(arr):
    count = 0
    for i in range(len(arr)):
        for j in range(i+1, len(arr)):
            for k in range(j+1, len(arr)):
                count += 1
    return count