Implement the following recursive function processString, which receives as parameters a string str, a single character ch, and the length of the string n. processString function replaces each occurrence of ch in the str with Its uppercase

#include <iostream>#include <string.h>using namespace std;int index1(char *T,char *P){int t=0,p=0,i,j,r;t = strlen(T);p = strlen(P);i=0;int max = t - p + 1;while(i<max){for(j=0;j<p;j++){if(P[j]==T[i+j]){r = i;break;}else r = -1;}i++;}return r;} int main(){ int l;char c[100];char d[100];cout<<"Enter First String\n"; cin>>c;cout<<"Enter Second String\n";cin>>d;l = index1(c,d);cout<<l; return 0;} Note: Remove Funcation

C++ Program  #include <iostream>#include <cstdlib>#include <ctime>using namespace std; int getData() {    return (rand() % 100);} class Node {public:    int data;    Node* next;}; class LinkedList{public:    LinkedList() { // constructor        head = NULL;    }    ~LinkedList() {}; // destructor    void addNode(int val);    void addNodeSorted(int val);    void displayWithCount();    int size();    void deleteAllNodes();    bool exists(int val);private:    Node* head;}; // function to check data exist in a listbool LinkedList::exists(int val){         if (head == NULL) {        return false;    }    else {        Node* temp = head;        while (temp != NULL) {                       if(temp->data == val){                return true;            }            temp = temp->next;        }    }    return false;} // function to delete all data in a listvoid LinkedList::deleteAllNodes(){        if (head == NULL) {        cout << "List is empty, No need to delete…

Static Length, Limited Dynamic Length, and Dynamic Length String implementations have what advantages and disadvantages?

c++

C programming

#include <iostream>using namespace std;class st{private:int arr[100];int top;public:st(){top=-1;}void push(int ItEM) {top++;arr[top]=ItEM; }bool ise() {return top<0;} int pop(){int Pop;if (ise()) cout<<"Stack is emptye ";else{Pop=arr[top];top--;return Pop;}}int Top(){int TOP;if (ise()) cout<<" empty ";else {TOP=arr[top];return TOP;}}void screen(){ for (int i = 0; i <top+1 ; ++i) {cout<<arr[i];} }};int main() {st c;c.push(1);c.push(2);c.push(3);c.push(4);c.pop();c.push(5);c.screen();return 0;} alternative to this code??

>> IN C PROGRAMMING LANGUAGE ONLY << COPY OF DEFAULT CODE, ADD SOLUTION INTO CODE IN C   #include <stdio.h>#include <stdlib.h>#include <string.h> #include "GVDie.h" int RollSpecificNumber(GVDie die, int num, int goal) {/* Type your code here. */} int main() {GVDie die = InitGVDie(); // Create a GVDie variabledie = SetSeed(15, die); // Set the GVDie variable with seed value 15int num;int goal;int rolls;  scanf("%d", &num);scanf("%d", &goal);rolls = RollSpecificNumber(die, num, goal); // Should return the number of rolls to reach total.printf("It took %d rolls to get a \"%d\" %d times.\n", rolls, num, goal); return 0;}