<p>Consider the following pseudo code in an imperativelanguage:</p><p><img alt="intx-1,n-10; function f O int x-3; function g (int c, d) { c- c-1 print(c, d, x, n); *end of g/ *body
<h3>Question Description</h3> <p>I need you to solve all these questions in the attached file and type them in a document some of these question did them myself but i need
<p dir="ltr"><img src="https://media.cheggcdn.com/media%2Fd7a%2Fd7aaec17-7cbe-46df-b350-7c255ef8166f%2Fimage" alt="+) | 100% 1- The time to convert an array, with priorities stored at subseripts 1 through n, to a minheap is in: A. e() B. o(logn)