This question is about the q-digest. The elements in the stream come from the range [1, 8]. Use k = 3, Run the q-digest algorithm on the following stream. Record the frequencies of all elements in the stream at the leaves of the complete binary tree before running the compression algorithm to identify the q-digest nodes. 5, 6, 4, 1,4, 2, 3,7,8,7, 3, 1,2,3, 3, 2,1,1,3, 6,5, 8, 8, 5, 4,2,5,1,6, 8, 4,2,2,6,7,8,7, 1,5,4, 8,2 (a) Draw the final complete binary tree (not only the nodes in the q-digest) and the values stored at the tree nodes. You do not need to give any intermediate step. b) Suppose that we sort the elements in the above stream in non-decreasing order. Use your q-digest to estimate the 20th number in this sorted list. This question is about the q-digest. The elements in the stream come from the range [1, 8]. Use k = 3, Run the q-digest algorithm on the following stream. Record the frequencies of all elements in the stream at the leaves of the complete binary tree before running the compression algorithm to identify the q-digest nodes. 5, 6, 4, 1,4, 2, 3,7,8,7, 3, 1,2,3, 3, 2,1,1,3, 6,5, 8, 8, 5, 4,2,5,1,6, 8, 4,2,2,6,7,8,7, 1,5,4, 8,2 (a) Draw the final complete binary tree (not only the nodes in the q-digest) and the values stored at the tree nodes. You do not need to give any intermediate step. b) Suppose that we sort the elements in the above stream in non-decreasing order. Use your q-digest to estimate the 20th number in this sorted list