One simple implementation of an ordered map that uses randomization for efficiency as well as a way to achieve search and update times which are O$($log n$)$ on average is known as the $\_\_\_\_\_\_\_\_\_\_\_\_\_\_.$

A$.$

Spring List

B$.$

Hop List

C$.$

Skim List

D$.$

Skip List