.(a)(3 points) Identify the recurrence equation that expresses the maximum number ofexpected users if a router is placed at locationi. Justify your answer.(b)(6 points) Write the pseudo code of an iterative algorithm that builds up solutions tolarger and larger subproblems. You have to show the time complexity of your algorithm(The time complexity must beO(n)).(c)(3 points) Prove the correctness of your algorithm.

Describe in pseudocode an algorithm that given an integer n and a linked list of elements increases the linked list by a factor of n by replacing each element in the original list with n copies of that element. for example, if l: [18, 7, 4, 24, 11] and n = 3 the resulting list should be l: [18, 18, 18, 7, 7, 7, 4, 4, 4, 24, 24, 24, 11, 11, 11]. if the value of n is less than or equal to 0, the list should be empty after the call. what’s the running time of your algorithm?

1. declare a constant named cents_per_pound and initialize with 25. 2. get the shipping weight from user input storing the weight into shipweightpounds. 3. using flat_fee_cents and cents_per_pound constants, assign shipcostcents with the cost of shipping a package weighing shipweightpounds.

When is it appropriate to use an absolute reference