See the code below. Write a template based implementation of function my_count which counts the number of instances of the first element in a sequence. For example, if the input is “1 3 2 4 3 1 4 1”, the output is “Found 3 instances of target 1”. Hint: Seek inspiration from the STL_intro_handout. #include #include using namespace std; int main() { list v; list::iterator iv; int value; while (cin >> value) v.push_back(value); int target = *v.begin(); int N = my_count(v.begin(), v.end(), target); cout << "Found " << N << " instances of " << target << "\n";

Write a display function and delete function in the following code:    Declare the libraries   Declare the struct Node       void create (int A[], int n)     {        int i;        struct Node *t, *last;        first = (struct Node *)malloc(sizeof(struct Node));        first->data=A[0];        first->next=NULL;        last=first;               for(i=1;i<n;i++)        {            t=(struct Node *)malloc(sizeof(struct Node));            t->data=A[i];            t->next=NULL;            last->next=t;            last=t;        }   } Write the Delete Function Write the display function     int main()   {       int A[]={10,20,30,40,50};       create(A,5);             Delete(first,4);             Display(first);       return 0;               }

struct insert_at_back_of_sll { // Function takes a constant Book as a parameter, inserts that book at the // back of a singly linked list, and returns nothing. void operator()(const Book& book) { /// TO-DO (3) /// // Write the lines of code to insert "book" at the back of "my_sll". Since // the SLL has no size() function and no tail pointer, you must walk the // list looking for the last node. // // HINT: Do not attempt to insert after "my_sll.end()". // ///// END-T0-DO (3) ||||// } std::forward_list& my_sll; };

Every time you write a non-const member function for a linked list, you should always think about if that function is preserving your class invariants. Group of answer choices A. True B. False