Suppose there are two unsorted arrays A and B, each consisting of n line segments. Each element belonging to A is a horizontal line segment with coordinates (0, a) and (a, b) for some 0 0. Each element belonging to B is a vertical line segment with coordinates (a’, 0) and (a’, b’) for some a’>0, 0
a) Prove that either the left-most vertical segment and the bottom-most horizontal segment intersect, or one of them does not intersect any segment.
b) Create a O(n) algorithm that checks if there exists at least one pair of intersecting line segments. Analyze the runtime and discuss the correctness of the algorithm.

Howard is designing a chair swing ride. the swing ropes are 5 meters long, and in full swing they tilt in an angle of 29° outside chairs to be 2.75 m above the ground in full swing.

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

Ais a picture icon that is a direct link to a file or folder