For this item consider the problem of finding the concatenation of even-length strings from a list, where the notation s || t means the concatenation of strings s and t in that order and the simple function len(s) 2 0 returns the length (number of characters) on string s. Concatenation of All Even-Lengthed Strings in a List (CONCATEVEN) Input: S[a...b] list of strings. Output: c= S[ij] || ... | S[im] where ii <... and len is even for all isksm or else the empty string e if list s contains no of length. let c2 b represent output concateven problem on input points state two different divide-and-conquer self-reductions above. give recursive algorithms pseudo-code based your self- reductions to solve what are worst-case runtimes solutions you have obtained runtimes. do not need show work.>