Problem 4 We say that an algorithm A makes non-adaptive queries to an oracle if it selects all of the strings on which it will query the oracle before querying the oracle on any of those strings (in other words, the queries to the oracle can be thought of as being carried out "in parallel" the choice of later query strings can't depend on the answers that the oracle provides to earlier queries). In contrast, an adaptive oracle algorithm makes its queries sequentially (in particular, the choice of the i-th query string for the oracle can depend on the answers that the oracle gave to query strings 1,,i1). Show that a language L is decided by a deterministic polynomial-time algorithm that has nonadaptive access to an NP oracle, if and only if L is decided by a deterministic polynomial-time algorithm that has adaptive access to an NP oracle but can make only O(logn) queries