The following program generates an error. Why? finalintNUM_ELEMENTS=5; int[] userVals = new int[NUM_ELEMENTS]; int i; userVals[0] = 1; userVals[1] = 7; userVals[2] = 4; for (i = 0; i <= userVals.length; ++i) { System.out.println(userVals[i]); }     a.   Variable i is never initialized.     b.   The array userVals has 5 elements, but only 3 have values assigned.     c.   The integer NUM_ELEMENTS is declared as a constant     d.   The for loop tries to access an index that is out of the array's valid range.     JAVA

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 <stdio.h>#include <stdlib.h>#include <time.h> struct treeNode {  struct treeNode *leftPtr;  int data;  struct treeNode *rightPtr;}; typedef struct treeNode TreeNode;typedef TreeNode *TreeNodePtr; void insertNode(TreeNodePtr *treePtr, int value);void inOrder(TreeNodePtr treePtr);void preOrder(TreeNodePtr treePtr);void postOrder(TreeNodePtr treePtr); int main(void) {  TreeNodePtr rootPtr = NULL;   srand(time(NULL));  puts("The numbers being placed in the tree are:");   for (unsigned int i = 1; i <= 10; ++i) {    int item = rand() % 15;    printf("%3d", item);    insertNode(&rootPtr, item);  }   puts("\n\nThe preOrder traversal is: ");  preOrder(rootPtr);   puts("\n\nThe inOrder traversal is: ");  inOrder(rootPtr);   puts("\n\nThe postOrder traversal is: ");  postOrder(rootPtr);} void insertNode(TreeNodePtr *treePtr, int value) {  if (*treePtr == NULL) {    *treePtr = malloc(sizeof(TreeNode));     if (*treePtr != NULL) {      (*treePtr)->data = value;…

#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…