For a positive integer N, let An be the set of integers 1 through N. A permutation of the set Ay is the ordered sequence (a1,a2,...,an) such that each integer appears exactly once. For instance, (1,2,4,3) and (2,4,3,1) are two permutations of the set A4. A permutation (a1, a2, ...,an) can be represented as an array P of length N where P[i] = a;. Given an integer N and array P of integers of length N, design an algorithm which checks whether P represents any permutation of An.

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