Let n hat represent the direction horizontally north, n e hat represent northeast (halfway between north and east), and so on. each direction specification can be thought of as a unit vector. rank from the largest to the smallest the following dot products. note that zero is larger than a negative number. if two quantities are equal, display that fact in your ranking. (use only "> " or "=" symbols. do not include any parentheses around the letters or symbols.)

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