Suppose you have two tables, R and S. These two tables have 10000 and 30000 tuples respectively. Suppose comparing two field values for equality takes one unit of time, and computing the hash of an indexed value takes two units of time. Approximately how much time would an equijoin query take on these tables if: a) You used the full cross product method (nested loop over both tables) b) You had a hash index into table Ron the relevant field c) There is no index, but you sort the two tables beforehand