Design an algorithm that takes an array of $n$ integers and returns a new array where each element

at index $i$ is the product of all the elements in the original array except the one at $i.$ The algorithm

should run in $O(n)$ time and should not use division.

$($a$)$ Describe your algorithm in pseudocode.

$($b$)$ Explain how your algorithm achieves $O(n)$ time complexity.

Solution Format: Provide the pseudocode with a brief explanation of each step, and then discuss

the time complexity.