Hello can you please help with this if you want to thank you!

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?

When designing content as part of your content marketing strategy, what does the "think" stage represent in the "see, think, do, care" framework?

Stacy works as blank. the most important soft skill she needs for this role is blank.