i need all answer soonly. make sure the answer is 100% correct. thanks on advance

Part Application 1. Analysis of algorithms. Consider the following code fragment. (8 Points) int func(int) { int i=0, sum=0; while (sumn) sumi; Tetumi; } (a) Suppose that it takes 1 second when N=3,500. Approximately how long will it take when N= 350,000? And why? 6) How to analyze different algorithms to select a better one? That is what factors we care most? Answer: 2. Consider the following binary tree representation (343 Points) A B R (a) the result of traversing under pre-order is () the result of traversing under in order is : () the result of traversing under post-order is : 3. Suppose we have the following sequence: 3, 57, 25, 17, 10, 9, 73 (15 Points) (a) Arrange the following values into a min-heap