Assume you have two algorithms, a and b, both of which perform the same function, although their implementations differ. assume that algorithm a has a running time of o(n3 + 2n2+6n +10) and algorithm b has a running time of o(6n2 + 3n +10 ). also assume that the value of n is restricted to the set of natural numbers i. e., {1, 2, 3, }. answer the follow­ing questions:

for what values of n algorithm a is more efficient than algorithm b?

for what values of n algorithm b is more efficient than algorithm a?

for what values of n might both algorithms be expected to operate with the same efficiency?

In addition to using the icons to adjust page margins, a user can also use

What are the most likely causes of conflict at the meeting? check all that apply.

Print "censored" if userinput contains the word "darn", else print userinput. end with newline. ex: if userinput is "that darn cat.", then output is: censoredex: if userinput is "dang, that was scary! ", then output is: dang, that was scary! note: if the submitted code has an out-of-range access, the system will stop running the code after a few seconds, and report "program end never reached." the system doesn't print the test case that caused the reported message.#include #include using namespace std; int main() {string userinput; getline(cin, userinput); int ispresent = userinput. find("darn"); if (ispresent > 0){cout < < "censored" < < endl; /* your solution goes here */return 0; }