NameBrynnley TompkinsDate10/24/2021Section:CSCI 10Chapter 8 H.W Abstract Data Types and SubprogramsExercises (20): 3, 6, 7, 13, 14, 17, 18, 19, 24, 26, 28, 37, 38, 47, 48, 52, 56, 57, 58,59For exercises 1-10, indicate which structure would be a more suitable choice froeach of the following applications by marking them as follows:A.Stack B. Queue C. Tree D. Binary search tree E. Graph3.) An electronic address book ordered by name.D. Binary search tree6.) A program to keep track of patients as they check into a medical clinic,assigning patients to doctors on a first-come, first-served bases.B. Queue7.) A program keeping track of where canned goods are located on a shelf.