Ab Abd AD AS ST 3. Suppose you are given the following array X-112, 10, 11, 20, 19, 18, 19, 32, 293 Write the state of the array after pasat if we apply the the most algorithm to it and intend to sort the array in ascending onder You DO NOT have to sort the whole array, just have to write the state of the array after pass 1. fasst 4. Suppose you are given the following array x 11, 6, 7, 9, 16, 201 And kny 20. Search for kay withis x uning binary search algorithm FOonch round how the values o low, highrid and comparison until the algoritheither finds the key in the array or does not vt round has been done for you. Round 1: low-O mid - 015/2 - 5/2=2 comparison 20 I Round 21 DEL F 10 12 15 P * ) & 7 BIC & 5 6 8 9 C C E R T Y O P G DF C H K ? CV B N M