i need answer in 90 minutes i will give like

Q4. [25 points] a) Construct the binary space partition (BSP) tree for the segments shown below (use alphabetical insertion order for the segments, when possible). Use the convention where the right subtree (child) is the side that the arrow points to. Show your work. . b) Given the point that shows the eye position, write the traversal order of your BSP tree for back-to- front rendering B F Q4. [25 points] a) Construct the binary space partition (BSP) tree for the segments shown below (use alphabetical insertion order for the segments, when possible). Use the convention where the right subtree (child) is the side that the arrow points to. Show your work. . b) Given the point that shows the eye position, write the traversal order of your BSP tree for back-to- front rendering B F