In C++ please

(5 x 3) Write a recursive program to do the following. In each case, you will first need to build the data structure involved (e.g., array or linked list) by taking inputs from a user-provided file or keyboard (your choice). Zero credit if your program is not recursive. For simplicity it is sufficient if your program only works for integers. a. Take two singly linked list L and M, and generate a new singly linked list that is a concatenation of L and M. b. Take an array A and an elemente and output the number of times e occurs in A. c. Search an element e in an unsorted array A