Aternary string is a sequence of 0's, 1's and 2's. just like a bit string, but with three symbols. let's call a ternary string good provided it never contains a 2 followed immediately by a 0. let g n gn be the number of good strings of length n . n. for example, g 1 = 3 , g1=3, and g 2 = 8 g2=8 (since of the 9 ternary strings of length 2, only one is not good).

answer:

(-8,7)

explanation:

we know that  

f

(

−

3

)

=

7

therefore, if we wish to get the output as 7, in the function, we need to have our input to be -3.

looking at the function  

f

(

x

+

5

)

, what should the value of x be, such that the input in the function becomes 7?

we simply equate the terms,

x

+

5

=

−

3

x

=

−

8

thus, the point on the new function would be  

(

−

8

,

7

)

they would have to work 32 hours.