1.) Write a function called canMakeSum() that takes a sorted array of n integers and determines whether two distinct elements of the array add up to some specified value, "key". If so, return 1. Otherwise, return 0. The function signature is:

int canMakeSum(int *array, int n, int key);

2.) Write an efficient function that takes a SORTED array of n integers and returns the number of times key appears in the array. The function signature is:

int keyCount(int *array, int n, int key);

3.) What are the best-case and worst-case runtimes of your keyCount() functions?