Write a non-static method to be added to a class that implements a singly linked list of integers. The method is called make_partition() and it takes an integer x as input. The method should modify this list by moving all the elements less than x to the front of the list, and all the elements greater than x to back of the list. It is not important for the elements to be kept in their original order. Note that this method should run in O(n) 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; }