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.

Determine the difference: 3.2 × 1010 – 1.1 × 1010. write your answer in scientific notation.

Boris needs to buy plastic spoons. brand a has a box 42 spoons for $2.37. brand b has a box of 72 spoons for $3.57. find the unit price for each brand. then state which brand is the better buy based on the unit price. round your answer to the nearest cent.

Someone answer asap for ! a discount store’s prices are 25% lower than department store prices. the function c(x) = 0.75x can be used to determine the cost c, in dollars, of an item, where x is the department store price, in dollars. if the item has not sold in one month, the discount store takes an additional 20% off the discounted price and an additional $5 off the total purchase. the function d(y) = 0.80y - 5 can be used to find d, the cost, in dollars, of an item that has not been sold for a month, where y is the discount store price, in dollars. create a function d(c(x)) that represents the final price of an item when a costumer buys an item that has been in the discount store for a month. d(c(x)) =