$3)$ Input a list of numbers and find the second$-$largest number in the list. For example, given the list: $[5,12,8,17,3,15],$ the second$-$largest number is $15.$

a$.)$ Algorithm

b$.)$ Flowchart $($make sure it's a good drawing or illustration$)$

NOTE:

Oval $-$ Start$/$end

Arrow$-$Connector

Parallelogram $-$ Input$/$output

Rectangle$-$Process

Diamond$-$Decision