Question 1: Algorithmic design and computational complexity (4 points). Provide the pseudocode for an algorithm that takes as input a list of integers and that finds the maximum product of a triplet in the list. Discuss the time and space complexity of your algorithm. Examples: - Input: [10,3,5,6,20], Output: 1200 (multiplication of 10, 6, and 20) - Input: [10,3,5,6,20], Output: -90 - Input: [1,4,3,6,7,0], Output: 168