Question 1 We have two input arrays, an array A with n elements, and an array B with m elements, where msn. There may be duplicate elements. We want to decide if every element of B is an element of A. a. b. (10 pts) Describe a brute-force algorithm. What is the worst-case time complexity? (20 pts) Describe an algorithm to solve this problem in O(m log n) worst case time. (Hint: You may apply instance simplification.)