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

in 2007, floridians died in alcohol-related collisions.a.  501b.  1,051c.  5,015d.  10,839

1. you have a small business that is divided into 3 departments: accounting, sales, and administration. these departments have the following number of devices (computers, printers, etc.): accounting-31, sales-28, and administration-13. using a class c private network, subnet the network so that each department will have their own subnet. you must show/explain how you arrived at your conclusion and also show the following: all available device addresses for each department, the broadcast address for each department, and the network address for each department. also, determine how many "wasted" (not usable) addresses resulted from your subnetting (enumerate them).

In which job role will you be creating e-papers, newsletters and preiodicals