Imagine that you need to develop a MapReduce algorithm to merge NoSQL and SQL datasets. Business Case A bike-sharing system is given, and every second of a state of all bike stations is represented in a NoSQL document of the following structure:

The dataset of all rides (time is given in seconds) is provided as a SQL table, with the following fields: pick_up_time, drop_off_time, user_id, start_station_id, end_station_id. Directions Write pseudocode to describe an efficient MapReduce algorithm (mapper and reducer) that allow merging those datasets to provide a relational dataset with all initial data from a rides dataset along with the number of bikes available at pick up the station when the bike was taken, and the number of parking spots available at the drop off location when the bike was returned.

\{ time: XXXXXX, stations: [ \{id: XX, num_bikes_available: XX, num_spots_available: XX}, \{id: XX, num_bikes_available: XX, num_spots_available: XX}