Show that the number of sequences of length 40 are there using the alphabet {a, b, c, d} such that number of 'a's in the sequence is divisible by 3 is [4^40+2Re((3+) 40) ] /3 . knowing that ^3 =1; 1++^2 =0