2. suppose you are given a string s of length n. describe an o(n)-time algorithm to find the longest string t that occurs both forwards and backwards in s. your algorithm must use suffix trees or generalized suffix trees.

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

)

76%

step-by-step explanation:

24% are dogs and the remaining is 76% because 100-24=76

the correct answer is you spend $55.78 more in a brand store that buy ing in a normal store.

step-by-step explanation:

brand = spend   $ 135.85 total

store = spend $80.07 total

jwjwkwkwkkkdjebd b jdjejdndj he jenej