You are given an unsorted list of numbers. you are told that the index of every number is at distance at most 100 from the index it will correspond to it if the list is sorted. use this information to design an algorithm that takes as input a list with this property and outputs the list sorted. explain the correctness of your algorithm and explain its running time. (hint: think how to find the minimal entry in constant time! )

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