Given two integers m≥2 and n≥2 we consider two types of sequences of length m⋅n formed exclusively by 0 and 1TYPE 1 sequences are all those that verify the following two conditions:∙ akak+m=0 for all k=1,2,3,...
∙ If akak+1=1, then k is a multiple of m. TYPE 2 sequences are all those that verify the following two conditions:∙ akak+n=0 for all k=1,2,3,...
∙ If akak+1=1, then k is a multiple of n.Prove that the number of sequences of type 1 is equal to the number of sequences of type 2. combinatoricsnumber theory