Given the following SkipList, identify the path taken to find (or attempt to find) a particular element. For this question, assume that "looking ahead" to the next node for a comparison does not count in the path. This means only nodes that are traversed should be included in the final output. Do not include traversing to null if the element is not in the SkipList. Identify the sequence of nodes traversed based on each level. The level numbers are labeled in the SkipList diagram. Answer Format: When you encounter a node, it is represented as the level on which the node occurs and the data in the node in the following format: (level \#, data). Should an infinity node be encountered, its data is specified as +inf or -inf. Keep in mind that nodes on different levels containing the same data are different nodes. The given answer choices are formatted as a path of (level \#, data), (level \#, data), ..., (level \#, data) Operation: Find 67 (3,-inf),(3,52),(2,52),(1,52),(1,63),(0,63)(0,-inf),(0,17),(0,24),(0,47),(0,52),(0,63)(3,-inf),(3,52),(2,52),(2,98),(1,98),(1,71),(0,71)(3,-inf),(3,52),(2,52),(1,52),(0,52),(0,63)(3,-inf),(2,-inf),(2,17),(1,17),(1,47),(1,52),(0,52),(0,63) Given the following HashMap which uses External Chaining as its collision resolution strategy, give the resulting table after performing the add operation for a new (key, value) pair: (17, "g") The hashcode of these particular keys (of type integer) are the integer value itself. The compression function is to mod by the table's length. The load factor of this particular HashMap is 0.67 . If a resize is required, resize the backingtable to backingTable: 0 : 1 : 2:(2,"f) 3:(8,"h")(13,"y") 4 : Your answer should be formatted similar to the above table, with indices on the left and any (key, value) pairs on the right, separated by an arrow if they've collided. 0: 1: 2:(17,"g")(2,f") 3:(8,"n)(13,4") 4: 0: 1: 2:(2,"f) 3:(13,"y) 4: 5: 6: 7:(17,"g) 8:(8,"h) 9:(1) 0: 1:(13,"y")(2,) 2:: 4: 5: 6: (17,"g") 7:(8,"h) 8: 9: 10