def create$\_$list$()$:

# Create an empty list and prompt for the number of integers

lst $=[]$

num$\_$values $=$ int$($input$("$Enter number of integers in list: $"))$

for i in range$($num$\_$values$)$:

value $=$ int$($input$($f$"$Enter item #$\{$i $+1\}$: $"))$

lst$.$append$($value$)$

return lst

def second$\_$highest$($lst$)$:

# Create a deep copy of the list and sort it to find the second highest

sorted$\_$lst $=$ lst$.$copy$()$

sorted$\_$lst$.$sort$()$

return sorted$\_$lst$[-2]$ # Return the second largest element

def make$\_$positive$($lst$)$:

# Modify the list to make all elements non$-$negative

for i in range$($len$($lst$))$:

if lst$[$i$]<0$:

lst$[$i$]=$ abs$($lst$[$i$])$

def main$()$:

# Create the list of integers

my$\_$list $=$ create$\_$list$()$

print$("$My original list:", my$\_$list$)$

# Find the second highest integer

second$\_$largest $=$ second$\_$highest$($my$\_$list$)$

print$($f$"$Second largest integer in list is $\{$second$\_$largest$\}")$

# Make all elements in the list positive

make$\_$positive$($my$\_$list$)$

print$("$My now positive list is$",$ my$\_$list$)$

if $\_\_$name$\_\_=="\_\_$main$\_\_"$:

main$()$