1. Write a recursive function to determine whether an integer n is perfect. (A number is perfect if it is equal to the sum of its factors. Thus 6 is perfect because 6 = 3 + 2 + 1.)
2. Write two procedures, one for inserting an item into a sorted array, and one for deleting an item from it.