A sorted list of n strings is given. Describe an algorithm that makes use of the sorted order and determines whether a given string x is a member of this list. What is the time complexity of your algorithm in terms of n and the length of x? Justify your answers.