Suppose there are 5 characters in a language L where L = {A,B,C,D,E} and that we have built a unigram model. The probabilities of each are as follows P(A) = 0.10, P(B) = 0.30, P(C) = 0.15, P(D) = 0.25, P(E) = 0.20 Calculate the perplexity of the following sequence: DAB For your answer, please round down to the closest integer