struct Info { int id; float cost; }; Given the struct above, the following code segment will correctly declare and initialize an instance of that struct. Info myInfo = {10,4.99}; Group of answer choices True False   ==============   Consider the following code fragment. int a[] = {3, -5, 7, 12, 9}; int *ptr = a; *ptr = (*ptr) + 1; cout << *ptr; Group of answer choices 4 -5 3 Address of -5   =============== What will happen if I use new without delete? Group of answer choices The program will never compile The program will never run The program will run fine without memory leak None of these

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

Write a function getNeighbors which will accept an integer array, size of the array and an index as parameters. This function will return a new array of size 2 which stores the neighbors of the value at index in the original array. If this function would result in returning garbage values the new array should be set to values {0,0} instead of values from the array.

In C++ language Write a function that takes a 1 Demensional array and an integer n and reutrns the number of times 'n' appears in the array. If 'n' does not appear in the array, return -1.

Declare a student structure that contains : Student's first and last nameStudent IDCreate the following functions: getStudentInfo(void) Declares a single student, uses printf()/scanf() to get inputReturns the single student backprintStudentInfo(student_t *st_ptr) Takes the pointer to a student (to avoid making a copy)Prints out all of the student informationDeclare an array of five studentsUsing a for loop and getStudentInfo() function, get input of all the studentsUsing a for loop and printStudentInfo() function, print all the output of all students.

#include <bits/stdc++.h> using namespace std;   struct Employee {     string firstName;     string lastName;     int numOfHours;     float hourlyRate;     char major[2];     float amount;     Employee* next; }; void printRecord(Employee* e) {     cout << left << setw(10) << e->lastName << setw(10) << e->firstName << setw(12)         << e->numOfHours << setw(12) << e->hourlyRate << setw(10) << e->amount         << setw(9) << e->major[0]<< setw(7) << e->major[1]<<endl; }   void appendNode(Employee*& head, Employee* newNode) {     if (head == nullptr) {         head = newNode;     } else {         Employee* current = head;         while (current->next != nullptr) {             current = current->next;         }         current->next = newNode;     } }       void displayLinkedList(Employee* head) {     Employee* current = head; if(current!=nullptr){   cout…

#ifndef INT_SET_H#define INT_SET_H #include <iostream> class IntSet{public:   static const int DEFAULT_CAPACITY = 1;   IntSet(int initial_capacity = DEFAULT_CAPACITY);   IntSet(const IntSet& src);   ~IntSet();   IntSet& operator=(const IntSet& rhs);   int size() const;   bool isEmpty() const;   bool contains(int anInt) const;   bool isSubsetOf(const IntSet& otherIntSet) const;   void DumpData(std::ostream& out) const;   IntSet unionWith(const IntSet& otherIntSet) const;   IntSet intersect(const IntSet& otherIntSet) const;   IntSet subtract(const IntSet& otherIntSet) const;   void reset();   bool add(int anInt);   bool remove(int anInt); private:   int* data;   int  capacity;   int  used;   void resize(int new_capacity);}; bool operator==(const IntSet& is1, const IntSet& is2); #endif

typedef _people {    int age;    char name[ 32 ]  ; } People_T ;   People_T  data [ 3 ]; Using string lib function, Assign  30 and Cathy to the first cell,  Assign  40 and John to the second cell  and Assign 50 and Tom to the third cell     People_T *ptr ;  Declare a pointer pointing to the structure data and print the age and name using the pointer.   your output can be :  30 Cathy 40 John 50 Tom

#include <bits/stdc++.h> using namespace std;   struct Employee {     string firstName;     string lastName;     int numOfHours;     float hourlyRate;     char major[2];     float amount;     Employee* next; }; void printRecord(Employee* e) {     cout << left << setw(10) << e->lastName << setw(10) << e->firstName << setw(12)         << e->numOfHours << setw(12) << e->hourlyRate << setw(10) << e->amount         << setw(9) << e->major[0]<< setw(7) << e->major[1]<<endl; }   void appendNode(Employee*& head, Employee* newNode) {     if (head == nullptr) {         head = newNode;     } else {         Employee* current = head;         while (current->next != nullptr) {             current = current->next;         }         current->next = newNode;     } }       void displayLinkedList(Employee* head) {     Employee* current = head; if(current!=nullptr){   cout…

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