Question 1: Apply Radix-Sort (LSD-First) on the following sequence of numbers. Show steps of sorting for each digit (corresponding to each column). [3] Question 2t a. Write the recursive solution for finding the length of the LCS (Longest Common Subsequence) [0.S] between twe strings. b. Find longest common sabsequence of the twe strings X and Y given below. Indicate the resulting longest common subsequence. [3] X=ABCB;m=X=4Y=BDCAB;n=Y=5j012345 Required LCS; c. What is the fime complexity of thls algorithm (to find length of LCS)? [0.5] Question 3: Consider the following two graph problems. [3] 3-Coloring (3COL): Given a graph G, can each of its vertices be labelled with one of 3 different "colours", such that no two adjacent vertices have the same label. Clique Cover (CC): The elique cover problem asks whether a graph's vertices can be partitioned into k or fewer sets such that each set of vertices induces a elique. That is, V=V1UV2Vk sueh that if u,vVi then uveE. 3COL is a knowa NP-eomplete problem. Prove that CC problem is also NP-eomplete by shiowing that 3COL is polvaemially reduelble to CC