A string that contains only Os, 1s, and 2s is called a ternary string. do not.. a) Find a recurrence relation for the number of ternary strings of length in that contain two consecutive Os. b) What are the initial conditions? c) How many ternary strings of length six contain two consecutive Os? > lapth 6 and do not contain "00".

Let n be a positive integer. Give a recursive algorithm for computing the sum of the first n positive integers by filling in the boxes in the procedure below with the expressions n, n – 1 or 1. Note: You have to use some expressions more than once, but each box must contain only one of those expressions. procedure sum : positive integer) if then sum 1 else sum + sum

Q10. A ternary string is an ordered string of characters which consists of digits (0,1, or 2). For example, the ternary string 2122010 consists of exactly 2 zero's, 2 one's and 3 two's; another ternary string meeting these conditions is 0021221. How many ternary strings are there with exactly 4 zero's, 2 one's and 6 two's?

In how many ways can we arrange all the letters in the word INFORMATION so that no pair of consecutive letters occurs more than once? (Note: IINNOOFRMTA is allowed but not INFORINMOTA, as IN occurs twice)