solve this question it's life or death?!!!!!!!!!!!!!!!!!!!!!!!!!


Take a list of length n where all the numbers are non-negative and unique. Find the element in the list possessing the highest value. Split the element into two parts where first part contains the next highest value in the list and second part hold the required additive entity to get the highest value. Print the list where the highest value gets split into those two parts. Sample input: 4 8 6 3 2 Sample output: 4 6 2 6 3 2 


Write your answer