IF YOU DO NOT HOW TO DO THIS, SKIP IT AND DO NOT WASTE MY CHANCE TO POST THE PROBLEM.

IF YOU DO NOT HOW TO DO THIS, SKIP IT AND DO NOT WASTE MY CHANCE TO POST THE PROBLEM.

IF YOU DO NOT HOW TO DO THIS, SKIP IT AND DO NOT WASTE MY CHANCE TO POST THE PROBLEM.

IF YOU DO NOT HOW TO DO THIS, SKIP IT AND DO NOT WASTE MY CHANCE TO POST THE PROBLEM.

Please, do not copy/paste the answer from the previous one since that person is just copying random answers from another question which is not related with this question at all. IF YOU DO NOT HOW TO DO THIS, SKIP IT AND DO NOT WASTE MY CHANCE TO POST THE PROBLEM.

Please, do not copy/paste the answer from the previous one since that person is just copying random answers from another question which is not related with this question at all, I really do need help with this, thank you! I will upvote for sure if it helps!

Given an array A of n elements that are integers from 0 to n-1, with any of these numbers appearing any number of times.

(a) Design an algorithm that finds the repeating numbers in A. For example, let n be 7 and array A be 1, 2, 3, 1, 3, 6, 6, the answer should be 1, 3 and 6. Give the pseudo code description of your algorithm and analyze its time complexity.

(b) Implement your algorithm using Java. Your program takes any sequence of numbers as the input, outputs the repeating number(s).

(c) Design an efficient algorithm for this task with time complexity O(n) and space complexity O(1).