In this assignment, you are expected to implement a priority queue (pq) as a heap in a static array of size 1000 to manage a line of clients in a bank. a record of a client is defined by the following structure: the name of a client, its date of birth, a numeric value indicating the client's account balance. older clients should have higher priority over young ones. the program to be implemented should then randomly generate 1000 "operations", where an operation can be a "push" of a client's record (randomly generated) or a "pop" removing the client from the front of the queue and printing its record in a single line on the screen (one line per client).