1. Write C++ code to declare a struct which is designed to hold a name, age and gpa. 2. Declare a variable called student to be of that struct 3. Declare an array called students where each location of the array is a name, age, and gpa. 4. Print the 5th location of the array 5. Print all the names in the array 6. Which array operations are inefficient and why? arget r S ata next lD 20 So 7. Given the picture of the linked list above, write the struct that will help to define the linked list and write statements to declare the variables: first, target and tail. 8. Write statement(s) to insert a node containing 5 at the front of the list 9. Write statements to insert a node containing 55 at the end of the list 10. Write statements to insert a node containing 25 in in appropriate place in the list 11. Write a statement to delete the node containing 30 from the list