All in C++

1. Write the minimum stockNode.h to support other DB classes class stockNode 2. Write the minimum DBarray.h (minus add/delete/find functions) where size of array is specified during construction time class DBarray 3. Write the minimum DBdlink.h (minus add/delete/find functions) class DBdlink 4. Write the minimum DBhash.h (hint: what do you need to support find by hash) class DBhash . Write the minimum DBheap.h (hint: what do you need to store stocks in a heap) class DBheap 6. Write remove_nth (remove nth node) function for DBdlink. (hint: watch for boundary conditions) void DBnk::remove nth(int n) 7. One way to keep DBarray sorted is to insert every element in-order. Write the implement code (cpp code) for the insert-in-order function void DBarray::insert-in-order(stocka s). void DBarray::insert-in-order(stock s) 8. What is the postfix notation for a -b(c/(d f) 9. (1 pt) What is a heap? 10. (1 pt) In 10 words, what's the main benefit of using heap? 11. Assume the following list of keys: 7, 28, 40, 31, 15, 42, 20, 88 with large key has higher priority. Show the resulting heap structure and list after it is heapified 12. As a general database, name two common restrictions of hash? How do you mitigate these restrictions? 13. Assume the following list of keys: 7, 28, 31, 40, 8, 20, 18 and we use hash with quadratic probing. If hash table size is 11 and hash function is modulo 10, show the resulting hash table