em-13 integers are in the range of 1 to n. There are no duplicates in the list. One of the integers is missing in the list. Given an algorithm to find the missing integer. Example: I/P:...

In java please you need to write code for this part Suggest two different method and show their time and space complexity. I didn't need code for this part. Thanks!!

Extracted text: em-13 integers are in the range of 1 to n. There are no duplicates in the list. One of the integers is missing in the list. Given an algorithm to find the missing integer. Example: I/P: [1,2,4,6,3,7,8] O/P: 5 Finding the Missing Number: We are given a list of n 1 integers and these