Expressing Algorithms$-$Finding the Maximum Number

In this assignment, you will modify an existing algorithm to solve a slightly different problem.

Problem $1(1$ point$)$ Please draw a flowchart for an algorithm that finds the two smallest

values in the collection. You can assume that the collection has at least two values and that all

values are distinct.

The algorithm works by making one pass through the collection and keeping track of the two

smallest values seen so far:

Initialize the two smallest values so far to be the first two elements of the list, name them as

min$1$ and min$2.$

For each remaining value in the list: if the value is smaller than either of the two smallest so

far, replace the larger of the two. Set min$1$ to the first value of the collection and min$2$ to the

second.

If the element is less than min$1$ and min$1$ is less than min$2,$

Then set min$2$ to that element's value

Otherwise, if the element is less than min$1$ but min$1$ is greater than min$2,$

Then set min$1$ to that element's value

Otherwise, if the element is greater than min$1$ and is less than min$2,$

Then set min$2$ to that element's value

After inspecting all elements, output min$1$ and min$2,$ which hold the two smallest values.

Given the list numbers $=[213,576,458,3,1001,5,783],$ please fill in the following table based

on the algorithm in Problem $1$ and answer the following questions.

What is the final value for min$1$ and min$2.$