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.

Graph the equationy= x+3[tex]y = x + 3[/tex]

Astudy was interested in determining if eating milk chocolate lowered someone's cholesterol levels.ten people's cholesterol was measured. then, each of these individuals were told to eat 100g of milk chocolate every day and to eat as they normally did. after two weeks, their cholesterol levels were measured again. is there evidence to support that their cholesterol levels went down? how should we write the alternative hypothesis? (mud = the population mean difference= before - after)a. ha: mud = 0b. ha: mud > 0c. ha: mud < 0d. ha: mud does not equal 0

Ntriangle abc, m∠a = 35° and m∠b = 40°, and a=9. which equation should you solve to find b?