module programming language - python

Given a queue, with all elements in the queue being distinct, write pseudocode for an algorithm that returns the sum of the elements in the queue. At the end of the algorithm, all the elements should still be in the queue in their original order. Do not use any additional queues, stacks, arrays or linked lists. Hint: After an element has been added to the sum, insert it back into the queue. This can be done in a while loop. Think about an appropriate condition to ensure that the while loop terminates. (7 marks) Modify the above algorithm so that it works when all the numbers are positive but not necessarily distinct. Do not use any additional queues, stacks, arrays or linked lists