Given the value of N where N ranges from 1,26] and Q where Q is the maximum number of queries that one can make, sort a list of distinct uppercase alphabets in ascending order. N indicates that there are N characters starting from 'A'. Hence, N = 5 means that our final list must contain 'A.'B,C D' and A single query is defined as printing out a string "? x y" where x and y represent the characters we want to check the relation between (e.g. " A B"). The problem restricts the number of such queries to Q. Hence, we must determine the final order of the characters using at most Q queries. For each query, we get a binary answer '' or'>' from stdin indicates that x comes before y in the final list.means otherwise I was wondering how to solve this problem, i mean how can i code the input that just randomly choose from ABCDE for example and give output such as ?AC ? AD . Please someone help me giving the idea for this