Suppose you are given an n -element sequence, S , containing distinct integers that are listed in increasing order. Given a number k , describe a recursive algorithm to find two integers in S that sum...

Suppose you are given an
n-element sequence,
S, containing distinct integers

that are listed in increasing order. Given a number
k, describe a

recursive algorithm to find two integers in
S
that sum to
k, if such a pair

exists. What is the running time of your algorithm?

Implement a recursive function with signature find(path, filename) that

reports all entries of the file system rooted at the given path having the

given file name.