Help with 20 please.

Student Home-myFSU OHw3_copd531 .pdf eChegg Study I Guided S , BryteWave: Algorithm DX CSecure https://shelf.brytewave.com//books/9780133072525/cfi/3531/4/4@0.00:61. : Apps New Tab Online Derivative Ca M ITSDocs Create Co in Uni ho do l ist db v vim notes in Unix, how do l cha C-String Password O introduction to OOP Implementing Sieve 000-a repetition of y. In terms of our application, x and y are the repeating sequences from the two ships, and s is the signal we're listening to: We want to make sure s unravels into simple repetitions of x and y. Give an efficient algorithm that takes strings s, x, and y and decides if s is an interleaving of x and y. 20. Suppose it's nearing the end of the semester and you're taking n courses, each with a final project that still has to be done. Each project will be graded on the following scale: It will be assigned an integer number on a scale of 1 to g> 1, higher numbers being better grades. Your goal, of course, is to maximize your average grade on the n projects. You have a total of H > n hours in which to work on the n projects cumulatively, and you want to decide how to divide up this time. For simplicity, assume H is a positive integer, and you'll spend an integer number of hours on each project. To figure out how best to divide up your time, you've come up with a set of functions {f : i = 1, 2, . n)(rough 5:45 PM 10/11/2017