This is Computer science 2 (java) related skip list question. I dont understand this so could you explain how to do this. Please make sure the solution is correct.

the first deseription of a skip list was described using a different node object for nhode. For this problem our skip list has a height of 3, and a left and right sentinel With these assumptions in mind answer the following question regarding following inserts? stHow many nodes would be visited for an initially "empty" skip list with the e me that a node will be visited only if the value of the visited node is less than node exists for each height. following inserts? (Ass that of the inserted node) Number of visited nodes during insert Value Height 5