Given a max heap of n items, you want to print all values in the heap that are greater than a given value k. Describe the fastest (in worst case big O) algorithm to do this. You can work directly with the heap array storage. Assuming there are m values in the heap that are greater than k, derive the worst case big O running time of your algorithm, with reasoning that accounts for all entities that are counted toward the running time. You may assume that printing an item takes O(1) time.

answer; certification; plz check first, i believe this is correct. good luck;

okay, so i know we just goofed around in that chat, but ive been like genuinly depressed, like medically depressed for almost 4 years now. i had my first panic attack when i was 8. i woke my mum up and told her i felt like i was in a dream. like i was a goldfish in a bowl, looking at all these things going on around me and feeling . tiny. wort hless. and i now am now 17 y/o. i still feel those emotions daily. life used to go by so quick.like every day i would wake up and just like want to go back to bed cause i always felt like i was in the wrong place. i guess looking back, i was in the wrong state of mind. i took a expensive like nice trip to whyoming with my grandfather and ha ted it. like idk why. i would have loved it now, but i found myself writing in a journal everyday because i would forget what happened the day before, couldnt remember what i ate for like the previous meal. just my memory left me for the week i was there. worst feeling ive ever experienced.