An array of 100 elements is to be
sorted using the bubble sort in the
modules (the one that tests the return value of
floatlargesttotop() to see if it can return
"early".) check all the true statements about the sort algorithm,
i. e., the sort method and its support methods. (check all
that apply.)

a. it will always return (completely sorted) after 99 data comparisons.
b. it will sometimes return (completely sorted) after only 99 data comparisons.
c. it will always require at least one swap.
d. it will always require at least 99 comparisons

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; }