Implement algorithm: There are two 2D-boxes that can placed on the coordinate system. A box can be represented by the position of the coordinates where it is placed. This can be listed as [x1, y1, x2, y2], where the first pair of coordinates correspond to the location of the bottom-left corner, and second pair of coordinates correspond to the top right corner. Given coordinates of two boxes, identify if they overlap. If they overlap return true else return false. Note: If the boxed that touch each other at the corner or edges should return false. A rectangle is represented as a list [x1, y1, x2, y2), where (x1, y1) are the coordinates of its bottom-left corner, and (x2, y2) are the coordinates of its top-right corner. Two rectangles overlap if the area of their intersection is positive. To be clear, two rectangles that only touch at the corner or edges do not overlap. Think if you can come up with recursive function to solve this problem, if yes write it, if not explain why. Write a function doBoxesOverlap(box1, box2) that take the coordinate positions of each box as input and return whether they overlap or not. Name your file BoxAlgorithm. py Example 1: Input: box1 = [0,0,2,2), box2 = (1,1,3,3] Output: true Example 2: Input: box1 = [0,0,1,1], box2 = (1,0,2,1)
Output: false