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

Create a console project in c#. 1. create an interface "imyinterface.cs" - add a method "string imessage()" 2. create a class named "c1.cs" - add 4 private data members, create property for each data member double loanamnout=0.0; double years=0.0; double interests=0.0; double interestrate=0.0; 3. - add a constructor with parameters to assign values to loanamnout, years, interestrate with values that user entered. 4. - add one method “payinterests()” to return the interests interests = loanamnout * interestrate * years 5. - inheritate "imyinterface", implement the method " imessage()", return string "be ready! ” 6. in program.cs, have users to enter loanamnout, years, interestrate. - call method payinterests() to display total interests. - call imessage() to display "be ready! ”