Insert the following integers, one at a time and in the order given, to a binary min heap. (Do not use the buildHeap operation.) 50, 10, 25, 44, 36, 7
The integer items are stored in a basic array, according to the implicit representation presented in the lecture videos. Assume that the root item is stored at index 1. To indicate the state of the binary min heap after all items have been inserted, fill in the blank by providing the integer item stored at each array index.
Index 1:
Index 2:
Index 3:
Index 4:
Index 5:
Index 6:

Read the following scenario, and then answer the question below. you want to send an e-mail to your boss requesting a meeting to discuss a raise. what is the best example of an e-mail to an employer about this meeting? “hey jason. can we chat about getting me more money soon? let me know. peace, meg.” “hello jason. pardon me for sending yet another e-mail today about my need to talk to you about my position and a possible pay increase. i am dying to know when you can talk. sincerely, meg.” “hello jason. i have been with the company for one year and have taken on more responsibilities than outlined in my job description. i would appreciate an opportunity to speak with you about my position. let me know when we can schedule a meeting. you, meg.” “greetings jason! i hope this e-mail finds you well and happy today. i really, really want to talk to you about something important. i am not sure if you have time. i hope you do. get back in touch with me and let me know when we might talk. ever so much for taking the time to read this. sincerely, meg.”