For this I don't even know where to start, If someone could help me out by providing pseudo-code or really well commented code I would really appreciate (I just need to know how to go about writing this). Please comment it well so I have a good understanding of what is happening so I could think of different ways of implementing it. Thank you in advance for the help, I really appreciate it!

P.S. here is an example of the input files provided to us:

G4V42S QUV3EG H7Y2FFJSDL8 N4C4KQ B85RKEW3XE8 G4V22R6 G4VGW6AL6K QCPQKV6D4C7 I0IMFYHLO8Y7 G4VNPXLM G4VJXV9MKL G4VY9J93UC8 G4VQT68 G4VF5QTCCU3 SK0ABY7 G4V1T5AVHDV6 6USDJP4VN4D G4VDETK3 G4VGSDRAD5 E1T4RG G4VT3Y9DU G4VHILI0MI4J 00DVVE0 J5OK0TMSQF7L BU5PP52 QF5S3TQ GHHQBYU3 81P563R 77DKG31GKKL G4VCS9DYAQW G4V9NDQ G4VXPC 38K9FC9 G4V4XTFC 4PLHLA G4VTVUMN1U7 6SDSLPLG NCDJRSQ0KO VA07EU8JQL G4V9531 G4VFB7 G4VHSA8 G4VO44MVHMYL G4V3ONEAN G4VG8BGOIB TRT06FJB23 G4VG8E G4VIAKI49RIL G4VKVLWA8UL G4VL9AYVF0D R76JVVQ7W YR1T33F 7VQY6K6WUXXG XDN2XB G4VD27UAVU NWWYL729XL3 G4VG29V9NYP G4VKRNNH195

***Note it is much longer than this, this is just a sample***

CARFAX, is a commercial service that supplies vehicle history reports to individuals and businesses on used cars and light trucks for the American and Canadian consumers. It keeps records of all Vehicle Identification Number (VIN). Where each VIN is unique and consists of alphanumeric characters (e.g. 4DUSROIQ8LN209176). The composition of Vehicle Identification Number is unique for each vehicle with maximum length is restricted to 17 alphanumeric characters. CARFAX has some lists that are local for cities and areas, where n counts a few hundred properties. Others are at the provincial state level, that is n counts tens of thousands or more, or even at country levels, that is n counts millions or more. Furthermore, it is important to have access to the vehicle history. Such a historical record for a Vehicle Identification Number should be kept in reverse chronological order (i.e. from most recent) CARFAX, needs your help to design a Customized "Vehicle history Report listing" data structure called CVR. Keys of CVR entries are vehicle identification numbers, that are strings composed of 10-17 alphanumeric characters, and one can retrieve the key of a CVR or access a single element by its key. Furthermore, similar to sequences, given a vehicle identification number in a CVR one can access its predecessor or successor (if it exists). CVR adapts to its usage and keeps the balance between memory and runtime requirements. For instance, if a CVR contains only a small number of entries (e.g., few hundreds), it might use less memory overhead but slower (sorting) algorithms. On the other hand, if the number of contained entries is large (greater than 1000 or even in the range of tens of thousands of elements or more), it might have a higher memory requirement but faster (sorting) algorithms. CVR might be almost constant in size or might grow and/or shrink dynamically. Ideally, operations applicable to a single CVR entry should be between O (1) and (log n) but never worse than O(n). Operations applicable to a complete CVR should not exceed O(n). You are asked to design and implement CVR, a customized data structure which automatically adapts to the dynamic content that it operates on. In other words, it accepts the size (total number of Vehicle Identification Number) as a parameter and uses an appropriate (set of) data structure(s) from the one(s) studied in class in order to perform the operations below efficiently! The CVR must implement the following methods: setThreshold(Threshold): where 100