Write a loop that subtracts 1 from each element in lowerScores. If the element was already 0 or negative, assign 0 to the element. Ex: lowerScores = {5, 0, 2, -3} becomes {4, 0, 1, 0}. #include using namespace std; int main() {    const int SCORES_SIZE = 4;    int lowerScores[SCORES_SIZE];    int i;    for (i = 0; i < SCORES_SIZE; ++i) {       cin >> lowerScores[i];    }    /* Your solution goes here  */    for (i = 0; i < SCORES_SIZE; ++i) {       cout << lowerScores[i] << " ";    }    cout << endl;    return 0; }

#include <iostream>#include <list>#include <string>#include <cstdlib>using namespace std;int main(){int myints[] = {};list<int> l, l1 (myints, myints + sizeof(myints) / sizeof(int));list<int>::iterator it;int choice, item;while (1){cout<<"\n---------------------"<<endl;cout<<"***List Implementation***"<<endl;cout<<"\n---------------------"<<endl;cout<<"1.Insert Element at the Front"<<endl;cout<<"2.Insert Element at the End"<<endl;cout<<"3.Front Element of List"<<endl;cout<<"4.Last Element of the List"<<endl;cout<<"5.Size of the List"<<endl;cout<<"6.Display Forward List"<<endl;cout<<"7.Exit"<<endl;cout<<"Enter your Choice: ";cin>>choice;switch(choice){case 1:cout<<"Enter value to be inserted at the front: ";cin>>item;l.push_front(item);break;case 2:cout<<"Enter value to be inserted at the end:…

#include <stdio.h>   int arrC[10] = {0}; int bSearch(int arr[], int l, int h, int key);   int *joinArray(int arrA[], int arrB[]) {     int j = 0;     if ((arrB[0] + arrB[4]) % 5 == 0)     {         arrB[0] = 0;         arrB[4] = 0;     }       for (int i = 0; i < 5; i++)     {         arrC[j++] = arrA[i];           if (arrB[i] == 0 || (bSearch(arrA, 0, 5, arrB[i]) != -1))         {             continue;         }         else             arrC[j++] = arrB[i];     }       for (int i = 0; i < j; i++)     {         int temp;         for (int k = i + 1; k < j; k++)         {             if (arrC[i] > arrC[k])             {                 temp = arrC[i];                 arrC[i] = arrC[k];                 arrC[k] = temp;             }         }     }     for (int i = 0; i < j; i++)     {         printf("%d ", arrC[i]);     }     return arrC; }   int bSearch(int arr[], int l, int h, int key) {     if (h >= l)     {         int mid = l + (h - l) / 2;           if…

For any element in keysList with a value greater than 50, print the corresponding value in itemsList, followed by a comma (no spaces). Ex: If the input is: 32 105 101 35 10 20 30 40 the output is: 20,30, 1 #include 2 3 int main(void) { const int SIZE_LIST = 4; int keysList[SIZE_LIST]; int itemsList[SIZE_LIST]; int i; 4 6 7 8 scanf("%d", &keysList[0]); scanf ("%d", &keysList[1]); scanf("%d", &keysList[2]); scanf("%d", &keysList[3]); 10 11 12 13 scanf ("%d", &itemsList[0]); scanf ("%d", &itemsList[1]); scanf("%d", &itemsList[2]); scanf ("%d", &itemsList[3]); 14 15 16 17 18 19 /* Your code goes here */ 20 21 printf("\n"); 22 23 return 0; 24 }

#include <iostream>#include <vector>using namespace std; void PrintVectors(vector<int> numsList) {   unsigned int i;    for (i = 0; i < numsList.size(); ++i) {      cout << numsList.at(i) << " ";   }   cout << endl;} int main() {   vector<int> numsList;   int userInput;   int i;    for (i = 0; i < 3; ++i) {      cin >> userInput;      numsList.push_back(userInput);   }    numsList.erase(numsList.begin()+1);   numsList.insert(numsList.begin()+1, 102);   numsList.insert(numsList.begin()+1, 100);    PrintVectors(numsList);    return 0;} Not all tests passed   clearTesting with inputs: 33 200 10 Output differs. See highlights below. Special character legend Your output 33 100 102 10 Expected output 100 33 102 10 clearTesting with inputs: 6 7 8 Output differs. See highlights below. Special character legend Your output 6 100 102 8 Expected output 100 6 102 8   Not sure what I did wrong but the the 33…

use code below in part with bts #include <stdio.h>#include <stdlib.h>#include <time.h> typedef struct node_struct {int item;struct node_struct *next;} node; /*** 10->NULL* We want to insert 20* First call ([10], 20) [not complete]* {10, {20, NULL}} To compute the conditional probabilities you need to determine unigram andbigram counts first (you can do this in a single pass through a file if you do thingscarefully) and store them in a Binary Search Tree (BST). After that, you can computethe conditional probabilities.Input filesTest files can be found on (http://www.gutenberg.org/ebooks/). For example,search for “Mark Twain.” Then click on any of his books. Next download the “PlainText UTF-8” format.In addition, you should test your program on other input files as well, for which youcan hand-compute the correct answer.Output filesYour program must accept the name of an input file as a command line argument.Let's call the file name of this file fn. Your program must…

2. int count(1); while(count <5) { } --count; std::cout << count << endl; Maal

#include <iostream>#include <iomanip>#include <string>using namespace std;struct menuItemType{string menuItem;double menuPrice;};void getData(menuItemType menuList[]);void showMenu(menuItemType menuList[] , int n);void printCheck(menuItemType menuList[], int menu_order[], int n);int main(){const int item = 8;menuItemType menuList[item];int menu_order[item] ={0};int choice =0;int count =0;bool order = true;getData(menuList);showMenu(menuList,item);while(order){cout<<"Enter the choice for the order or press 0 to exit"<<endl;cin>>choice;if(choice>0 && choice<=item){menu_order[choice-1]+=1;}else{order=false;}}printCheck(menuList,menu_order,item);return 0;}void getData(menuItemType menuList[]){menuItemType plainEgg;menuItemType baconEgg;menuItemType muffin;menuItemType frenchToast;menuItemType fruitBasket;menuItemType cereal;menuItemType coffee;menuItemType tea;plainEgg.menuItem = "Plain Egg";plainEgg.menuPrice = 1.45;baconEgg.menuItem =…

Write a loop that subtracts 1 from each element in lowerScores. If the element was already 0 or negative, assign 0 to the element. Ex: lowerScores = {5, 0, 2, -3} becomes {4, 0, 1, 0}. #include <iostream>using namespace std; int main() {   const int SCORES_SIZE = 4;   int lowerScores[SCORES_SIZE];   int i;    for (i = 0; i < SCORES_SIZE; ++i) {      cin >> lowerScores[i];   }    /* Your solution goes here  */    for (i = 0; i < SCORES_SIZE; ++i) {      cout << lowerScores[i] << " ";   }   cout << endl;    return 0;}

Assume int[] t = {0, 1, 2, 3, 4, 5}; What is t[6]?   undefined, there is an error in this code 4 6 5