A ternary string is a string consisting of the characters 0,1 and 2. (12 points) i. How many n-length ternary strings are there that avoid 00, 11. 22? ii. How many bits would the most efficient encoding of such strings use? (in terms of n.)iii. Develop your own encoding/decoding algorithm where the code uses this number of bits. (Please give a brief description of how it works on an arbitrary input.)iv. Use your encoding to encode the following strings: a. 012102 b. 21212 c. 010201 v. Use your decoding to decode the following strings: (put "not decodable" if you can't decode the string.) •a. 11000b. 10111 .c. 00000