DNA is sequence of bases A, G, T, C. Let DNA [a..b] be the subsequence of DNA starting from index a finishing in b inclusive, and DNA[a..] be the subsequence of DNA starting from index a to the end. We could perform the following ops on DNAS: cross operation - they take DNA1 and DNA2 and numbers kl and k2. Then two new DNAS are created: DNA3 = DNA1[1,,k1]+DNA2[k2+1..] and DNA4 = DNA2[1.k2]+DNA1[k1+1.].mutate operation - they take a DNA, number k and one of the bases. Then they replace the base in position k in DNA with that base. also, they need to know certain characteristics of those DNAS. So, they can perform count operation - they take DNA and numbers k1 and k2 (k1 <= k2). This operation should return the number of A, G, T, C bases in DNA[k1..k2].The initial DNAS are numbered from 1 to n, where n is the amount of those DNAS. The new DNAS the first line of input file contains number n- the number of initial DNAS. Each of the following n lines contains the description of each DNA. The next line contains number q- the number of operations to perform. The next q lines contain the description of each operation in the following form: CROSS id1 id2 k1 k2 MUTATE id k m COUNT id k1 k2 For each count operation print four integers: the number of each of the bases in the given subsequence of the given DNA. Use Python Only Input: 2 CTCGC TGCGG 5 MUTATE 1 2 A COUNT 2 24 MUTATE 21G CROSS 2115 COUNT 4 36 Output: 0201 0202