C++ please

Part 1 Write a header file called boxer.h which includes: a ) a boxer struct with name and boxerID variables b ) a function prototype to add boxers to a data structure c ) a function prototype to delete a boxer from the data structure e ) a function prototype to print a weight class of boxers from the data structure f ) a function prototype to print all boxers in the data structure g ) a function prototype to determine if a boxer is in the data structure Part 2 Write an implementation file called boxer.cpp with the functions definitions for all functions created in boxer.h

Part 3 Provide the time complexity for each function in boxer.cpp and the main function in client.cpp in your comments [You must provide an explanation for how you you determined the time complexity of each function]