Using the attached code as a model, write a program where each student record is a structure that looks like this:   struct StudentRec { string last_name = "";          // Last name string first_name = "";         // First name int year_grad = 0;                  // Year expected to graduate float gpa = 0.0;                       // Current gpa } The program should ask for the data to fill a studentRec of structure StudentRec and then ask y/n if they want to add another studentRec. Each studentRec will go into the vector of type StudentRec called student_list. After the student records have been entered into the vector student_list, find the average gpa of all the students in the vector. Output all the student records and give the average gpa for the students. Use the iomanip tools to make the data look as nice a possible.

Use C++ codingNested Structures: Define a structure for Student containing information about name, roll number, address. The Address is itself another structure containing house no., street no., sector no., phase no., city name. Using arrays declare two addresses for the student: one address is for temporary address and second one is for permanent address. Declare one student structure variable and using pointer to this structure variable take input from the user to enter the information about the student.

C++ program #include<iostream> #include<fstream> #include<string> using namespace std; const int NAME_SIZE = 20; const int STREET_SIZE = 30; const int CITY_SIZE = 20; const int STATE_CODE_SIZE = 3; struct Customers { long customerNumber; char name[NAME_SIZE]; char streetAddress_1[STREET_SIZE]; char streetAddress_2[STREET_SIZE]; char city[CITY_SIZE]; char state[STATE_CODE_SIZE]; int zipCode; char isDeleted; char newLine; }; void add_data(int no_of_records, ofstream& fout) { struct Customers c; cout << "Enter the Customer data:" << endl; cout << "Name:"; cin >> c.name; cout << "Street Address 1:"; cin >> c.streetAddress_1; cout << "Street Address 2:"; cin >> c.streetAddress_2; cout << "City:"; cin >> c.city; cout << "State:"; cin >> c.state; cout << "Zip Code:"; cin >> c.zipCode; cout << endl; c.customerNumber = no_of_records; c.isDeleted = 'N'; c.newLine = '\n'; cout…

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.

C++ Program: #include <iostream>#include <string> using namespace std; const int AIRPORT_COUNT = 12;string airports[AIRPORT_COUNT] = {"DAL","ABQ","DEN","MSY","HOU","SAT","CRP","MID","OKC","OMA","MDW","LAX"}; int main(){   // define stack (or queue ) here     string origin;   string dest;   string citypair;     cout << "Loading the CONTAINER ..." << endl;   // LOAD THE STACK ( or queue) HERE   // Create all the possible Airport combinations that could exist from the list provided.   // i.e DALABQ, DALDEN, ...., ABQDAL, ABQDEN ...   // DO NOT Load SameSame - DALDAL, ABQABQ, etc .. cout << "Getting data from the CONTAINER ..." << endl;// Retrieve data from the STACK/QUEUE here      }    Using the attached program (AirportCombos.cpp), create a list of strings to process and place on a STL STACK container.  The provided code is meant to be generic.       Using the provided 3 char airport codes, create a 6 character string that is the origin &…

C++ Data Structure:Create an AVL Tree C++ class that works similarly to std::map, but does NOT use std::map. In the PRIVATE section, any members or methods may be modified in any way. Standard pointers or unique pointers may be used.** MUST use given Template below: #ifndef avltree_h#define avltree_h #include <memory> template <typename Key, typename Value=Key> class AVL_Tree { public:      classNode {      private:          Key k;          Value v;          int bf; //balace factor          std::unique_ptr<Node> left_, right_;          Node(const Key& key) : k(key), bf(0) {}          Node(const Key& key, const Value& value) : k(key), v(value), bf(0) {}      public:          Node *left() {              return left_.get();      }      Node *right() {          return right_.get();      }      const Key& key() const {          return k;      }      const Value& value() const {          return v;      }      const int balance_factor() const {…

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