Create a protocol that will solve the problems you saw with Protocol 1 by doing some error-checking. The sender should be able to construct a single multi-packet message that is sent at once. Afterwards they can keep communicating to fix any errors in the transmission. Things to consider: - How will the receiver know the order of the packets or if any are missing?
- How will the receiver request missing packets and what will the sender do in response?
- How will both sender and receiver know the full message arrived successfully?

Write a function called checkfactor that takes two arrays of positive numbers, firstnumberrow and secondnumberrow. checkfactor checks if the first entry in firstnumberrow is divisible by the first entry in secondnumberrow, and performs the same operation on the next array elements until all entries have been checked. all the numbers are positive and the number of entries in the arrays are the same. the function should return the identified divisible numbers in two row arrays named firstdivisible and seconddivisible. restrictions: branches or loops should not be used. the code must use the internal mod and logical functions. hint: the mod function should be used to determine if two numbers are divisible. ex: for num1 and num2 if mod(num1,num2) is 0, then the two numbers are divisible. this is matlab