1. You are given a book and a short text message. You are askedto cut letters from the book to compose the message. Give anefficient algorithm to determine if the message can be composedusing this scheme (i.e., do all the letters in the message occur inthe book?). Clearly state your assumptions, define variables, anduse data structures as necessary.
2. A is an array of length n with distinct integers. The first kelements of A are in increasing order, and the next n − k elementsare in decreasing order. We are not given the value of k. Givepseudocode for a logarithmic-time divide-and-conquer
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured