(See Exercise J) Suppose that we wish to translate four digit octal numbers into their binary form. For example, the binary representation of the octal number 2353 is 10011101, since 235g = 15710 = 27+0.26 +0.25 + 24 + 23 + 22 +0 -21 +2. What is the minimal bit length necessary to encode an arbitrary four digit octal number? (Hint: enter the length of the largest binary number representing a four digit octal number, not the value of the number itself.) Humans have been contacted by intelligent life from the planet Ambigupiter. This species has three different truth-values in their logical system: T ("true"), F ("false"), and M (maybe, as far as we can tell). How many possible answers are there to a True/False - Maybe quiz from Ambigupiter with three questions, if their religion requires that no answer of T may be followed by an M? In other words, determine the number of strings of length three written using the alphabet {T, F, M} without the sequence "TM" appearing as a substring