A person is trying to remember a list of 12 different items: snow, strawberry, football, banana, soccer, rain, apple, tennis, sleet, hail, orange, rugby

In order to better remember them, he compresses the original list into something shorter that is easier to remember. What would be a compression that would best help him remember the 12 items?

Suppose s, t, and w are strings that have already been created inside main. write a statement or statements, to be added to main, that will determine if the lengths of the three strings are in order by length, smallest to largest. that is, your code should determine if s is strictly shorter than t, and if t is strictly shorter than w. if these conditions hold your code should print (the boolean value) true. if not, your code should print false. (strictly means: no ties) example: if s, t, and w are "cat", "hats", and "skies" your code should print true - their lengths are 3-4-5; but if s, t, and w are "cats" "shirt", and "trust", then print false - their lengths are 4-5-5 enter your code in the box below

3.11.3 quiz: comparing and analyzing function typesquestion 4 of 102 pointswhat can you say about the y-values of the two functions f(x) = 3x2-3 andg(x)=2* - 3?

Worth 50 points answer them bc i am not sure if i am wrong