∑i=1q(i) =n2(n+ 1).for which choice ofq(i) will in-duction work? (a) 3i2−2(b) 2i2(c) 3i3−i(d)i(3i−1)(e) none of the . definerto be the binary relation onnsuch thatnrmiff√n·m≥nris a symmetric relation relation(a) true(b) . definerto be the binary relation onzsuch thatnrmiff√n·m≤n. ris an equivalence relation(a) true(b) . suppose thata≡4 mod 7 andb≡6 mod 7findcwith 0≤c≤6 such thatc≡2a+ 4bmod 7(a) 1(b) 7(c) 0(d) none of the . leta, b,c∈zsuch thata|(b+c) andb|cthena|c(a) true(b) .∀n∈{1,2,},1 + 3 + 9 + 27 ++ 3n=−1−3n+12(a) true(b) . does 3|(n3+ 3n2+ 2n) for alln∈n? (a) true

Match the following. 1. show grouping of word processing tasks that can be performed quick access toolbar 2. shortcut location for commonly used elements scroll bars 3. organized commands used to modify documents ribbon 4. used to align and measure content in a word screen zoom bar 5. vertical and horizontal bars that are used to navigate through a document contextual tabs 6. displays the name of the document in use ruler 7. allows users to enlarge or shrink a visual of a word document title bar

While preforming before operation pmcs, you notice the front right tire appears slightly under-inflated. what is the proper action?

A-12.3 an american spy is deep undercover in the hostile country of phonemia. in order not to waste scarce resources, any time he wants to send a message back home, he removes all the punctuation from his message and converts all the letters to uppercase. so, for example, to send the message, “abort the plan! meet at the dark cabin.” he would transmit given such a string, s, of n uppercase letters, describe an efficient way of breaking it into a sequence of valid english words. you may assume that you have a function, valid(s), which can take a character string, s, and return true if and only if s is a valid english word. what is the running time of your algorithm, assuming each call to the function, valid, runs in o(1) time?