A set S consists of strings obtained by juxtaposing one or more copies of 1110 and 0111. Use mathematical induction to prove that for every integer n $ 1, if a string s in S has length 4n, then the number of 1s in s is a multiple of 3.State the proof in symbolic form like nD, P(n) and also explain what P(n) and the set D is .