Suppose for the worst case, given input size n: algorithm 1 performs f(n) = n2 + n/2 steps algorithm 2 performs f(n) = 12n + 500 steps what is the smallest value of n for which algorithm 2 will be faster than algorithm 1?

You should try to photograph people on bright sunny days because the light will be best a) true b) false

Aisha has finished working on a word processing document that contains 15 pages. she has added some special elements in the first three pages, page 9 and 10, and page 15 from the document. she wants to print only these pages to see how they look. which option is the correct way to represent (in the print dialog box) the pages that aisha wants to print

Simon says is a memory game where "simon" outputs a sequence of 10 characters (r, g, b, y) and the user must repeat the sequence. create a for loop that compares the two strings starting from index 0. for each match, add one point to userscore. upon a mismatch, exit the loop using a break statement. assume simonpattern and userpattern are always the same length. ex: the following patterns yield a userscore of 4: simonpattern: rrgbryybgy userpattern: rrgbbrybgy