**Please code in java**

**please post all 3 algorithms**

**please post screenshot of output**

**please do not copy and paste previous answer as it was wrong**

Design and implement THREE different algorithms to find a missing number in integer array of 1 to n. The array is not sorted. The missing number could have been replaced by value 0. Analyze the worse-case complexity (the max number of iteration you need) for each design.

For example, when n is five. The array without missing number should be 1, 2, 3, 4, and 5, but you may see 1, 3, 0, 5, 2 in the array with a missing number. You need to find the missing number, which is 4.

Hint: 1) you can check the number from 1 to n and see which one is missing. 2) you can sort the array and then find the missing number. 3) you can check the sum of all numbers.