4. (20%) Give a group of integer numbers stored in array A 0.7] {21, 19, 54, 92, 11, 7, 20, 373. If we use the Quicksort method to sort them, draw diagrams to illustrate steps for the first PARTITION (use "HoarePartition"). 5, (2000) We have two input lists, a list A with m elements and a list B with n elements, where mn. There may be duplicate elements. We want to decide if every element of B is an element of A. 1) Design a brute-force algorithm. What is the worst-case time complexity? 2) Design an algorithm to solve this problem in O(n log m) worst-case time