i need c Solution

Given an integer array with the size of (n + 1) which contains numbers from 1 to n but one number is duplicate. Find that number in linear time and space. This means you are not allowed to use any kind of nested loop or any additional array apart from the array itself. You are given the array elements in the input, read them one by one unless user press enters. You can assume that there are at most 101 numbers in the input For example: Input Result 89 7 6 11 10 1 3 2 4 10 5 10 99 12 62 39 43 70 89 73 52 23 86 42 31 44 36 60 94 19 41 14 78 65 67 3 92 81 11 866 74 69 91 83 13 49 45 1 33 24 59 56 32 82 71 47 97 37 54 99 46 64 9 85 93 90 96 679 2 61 58 17 10 35 26 16 5 55 28 76 51 100 50 20 38 29 63 15 77 84 74 53 87 30 88 72 48 57 40 22 98 99 68 75 25 27 30 21 34 9518 CH W E 24 | . . 1 Normal 1 No Spaci... Heading 1 Heading 2 Title Subtitle Paragraph Styles C programming language Given an integer array with the size of (n + 1) which contains numbers from 1 to n but one number is duplicate. Find that number in linear time and space. This means you are not allowed to use any kind of nested loop or any additional array apart from the array itself. You are given the array elements in the input. read them one by one unless user press enters. You can assume that there are at most 101 numbers in the input For example: Input Result 8.9 7 6 11 10 1 3 2 4 10 5 10 99 12 62 39 43 70 89 73 52 23 86 42 31 44 36 60 94 19 41 14 78 65 67 3 92 81 11 866 74 69 91 83 13 49 45 1 33 24 59 56 32 8271 47 97 37 54 99 46 64 9 85 93 98 96 679 2 61 58 17 10 35 26 16 5 55 28 76 51 100 50 20 38 29 63 15 77 84 74 53 87 88 88 72 48 57 40 22 98 99 68 75 25 27 30 21 34 95 18