rite a new setter function template for your DynamicArray templated class per the following prototype: void swap(int, int); ...that swaps the values stored at the indexes represented by the two parameters. You decide how to deal with indexes that are beyond the capacity of the DynamicArray. Write the whole function template.

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 running anti-virus software , what could be a reason where recipitent is not guaranteed that data being streamed will not get interrupted?

If your accelerator suddenly gets stuck what should you do