5.1. Write the pseudocode for a linear time algorithm that finds the two smallest integers in a list of n distinct integers. Important: Your algorithm should run in (n) time 1. Moreover, it should pass through the list only once. 5.2. Using Example 22 as a guide, write down three matrices A,B, and C such that calculating (AB)C is cheaper (takes fewer operations) than calculating A(BC). Make your life easier by choosing matrices of small sizes. Example 22. Suppose A=123031,B=[10211002],C=1101