I need a short answer without explanation, only a short answer to each question

Question I: Apply Radix-Sort (LSD-First) on the following sequence of numbers. Show steps of sorting for each digit (corresponding to each column). [3] Qaestion 2t Write the recursive solution for finding the length of the LCS (Longest Common Subsequence) between two strings. b. Find longest common subsequence of the twe strings X and Y given below. Indileate the resulting longest common subsequence. [5] Required LCS: c. What is the fime complerity of this algorithm (to find length of LeS)? [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 clique 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-VIUV2 .. UV k such that if u,vVt then uveE. 3COL is a known NP-complete problem. Prove that CC problem is also NP-eomplete by showing that 3COL is polvaomially reducible to CC problem. Answert