2.2 EXPLORE For this item consider the problem of finding the concatenation of even-length strings from a list, where the notation sit means the concatenation of strings s and in that order and the simple function len(s) 20 returns the length (number of characters) on string s. Concatenation of All Even-Lengthed Strings in a List (CONCATEVEN) Input: Sla...bj list of strings. Output: C = Sill... Slim where it <... and len is even for all isksm or else the empty string e if list s contains no of length. let c2 represent output concateven problem on input sla...bl. 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. expand consider following recurrence t l n d vn n24 use repeated substitution method come up with a good guess bound g prove by induction theorem showing o same function gin guessed above thereby proving that grading will be docked errors in math disorganization lack clarity incomplete proofs>