provide clear explanation, the language is python

1. A Ranked Set [10 points] 1 Design a version of a skiplist that implements the SSet interface, but also allows fast access to elements by rank. That is, it also supports the function get(i), which returns the element whose rank is i in O(logn) expected time. (The rank of an element x in an SSet is the number of elements in the SSet that are less than x.) Describe how your version differs from a regular skiplist and provide pseudocode of f ind (x) and get (i) for this version