Given two entities E_1 and E_2, each of them has 200 binary attributes. The table below is the contingency table for these two entities. Each cell in the table shows the number of attributes where E_1 and E_2 have the corresponding combination of values, e.g., for the cell E_1 = 1 and E_2 = 0, there are 38 attributes with such a combination. Suppose all the attributes are asymmetric binary attributes, please calculate the Jaccard coefficient of E_1 and E_2 Suppose we have the following 2-D data set: Given a new data point, d = (1.4, 1.6) x y d_1 d_2 d_3 d_4 d_5 1.5 2 1.6 1.2 1.5 1.7 1.9 1.8 1.5 1.0 as a query, rank the database points based on similarity (from the most similar to the least similar) with the query using Euclidean distance, Manhattan distance supremum distance, and cosine similarity