Cyclic Redundancy Check (CRC) is an effective error detection mechanism. Suppose you have data bits of 10010011011 and divisor is 10011. As per the given information, what is encoding bits at the sender side? Similarly, at the receiver end ensure syndrome value is zero. Follow all necessary steps to complete calculation at both ends.

Suppose we are performing a binary search on a sorted array called numbers initialized as follows: // index 0 1 2 3 4 5 6 7 8 9 10 11 12 13 int[] numbers = {-2, 0, 1, 7, 9, 16, 19, 28, 31, 40, 52, 68, 85, 99}; // search for the value 5 int index = binarysearch(numbers, 5); write the indexes of the elements that would be examined by the binary search (the mid values in our algorithm's code) and write the value that would be returned from the search. assume that we are using the binary search algorithm shown in lecture and section.