int containsKey(LonelyPartyArray *party, int key); Description: Perform a linear search through the entire lonely party array to determine whether it contains key (i.e., whether key is stored in any of the cells in the LPA). Be careful to avoid segmentation faults. Output: This function should not print anything to the screen. Returns: Return 1 if the LPA contains key. Otherwise, return 0. If party is NULL, return