6. the while loop is this type of loop. a. pretest b. posttest c. prefix d. postfix

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?

Which spereadsheet type will determine how well a bussiness has done over the past year

Select all that apply. which of the following are proofreading options included in microsoft word? spell check find replace grammar check formatting check