1. Consider the following program that uses a data structure P: Program1 (A, n) /* A is an array of n elements 1 P.Initialize(); 2 for i 1 to n do 3 4 5 6 end 7 while P.Size() # 0 do 8 xP.ExtractMax (); Print x; for j1 to [²/³] do | P.Insert (A[i] * A[j]); end 9 10 end P.Initialize () initializes the data structure P. P.Insert (x) inserts elements x in P. P.ExtractMax () returns the maximum element of P and deletes it from P. P.Size() returns the number of elements in P. Analyze carefully the running time of Program1 assuming that the data structure P is implemented as a Max-Heap. (Analyze the total time for both the P.Insert () and P.Extract Max () operations. Note that the time for P.Insert () and P.Extract Max () is dependent on the number of elements in P which changes over the running time of the algorithm. Operations P.Initialize() and P.Size() take constant time.) Show your work.

octal numbers are made using the eight digits 0,1,2,3,4,5,6,7. How many octal numbers are 4 digits long, where the first digit must be from 1 to 7

use visual basic

Convert the decimal number 34492.696289062 into a HEX NUMBER showing the steps (Note : The problem should be solved in separate paper with steps and scanned copy should be submitted along with other answers Final answer must be entered in the boxes provided below. For Hexadecimal digits from A to F, enter their equivalent decimal value in the corresponding box; do not enter the letter; (For eg, if answer is A, ther enter 10, for B, enter 11 and so on) Enter only one digit in each box. Also fill the unused boxes with zeros) However, in your written submissions, use the letters A to F instead of the values The integer part = The fractional part =