You are hired to help the Lead Technical Analyst of the FBI…

Yоu аre hired tо help the Leаd Technicаl Analyst оf the FBI Behavioral Unit in joining various tables and doing cross-references to help the FBI field agents to fight crimes. You are working up against an incredibly tight deadline because the suspects (the "unsub") may strike again in 24 hours. The tables that you are working with are big, but not sorted or indexed. You need to implement a decent join algorithm.  Will you choose tuple-based nested-loop join, block-based nested-loop join, sort-merge join, or hash join? Please justify your answer, i.e., clearly explain why you think your choice is the best among these 4 options by discussing inputs, pseudocode, and complexity for the join algorithm you are choosing.