return_bike(station_id: int, stations: List["Station"]) -> bool: """Update the available bike count and the docks available count for station in stations with id station_id as if a single bike was making an additional dock unavailable. Return True if and only if t return was successful. Precondition: station_id will appear in stations. >> available_dock_station 43.681991, -79.329455, 15, 4, 10] >> station_id = available_dock_station[ID] >> original_bikes_available = available_dock_station[BIKES_AVAILAB >>> original_docks_available = available_dock_station[DOCKS_AVAILAB [7090, 'Danforth Ave / Lamb Ave',

Try switching the joins pthread_join(tid2, NULL); pthread_join(tid1, NULL); Do you see any difference? Please report if and why you do or do not see any difference in terms of the randomness in the result of the shared resource.  In the inc_dec_resource() function, implement mutual exclusion (pthread_mutex_lock) to ensure that the result becomes 0 every time when you execute your program. Put your updated code in the report (highlighted) and show your screenshot of the execution by running the script three time using $ time ./shared_resource_mutex. Hint: Your loop is incrementing/decrementing the resource which should be protected by each thread while it is executing that portion.   #include <stdio.h> #include <pthread.h>   #define iterations 300000000 long long shared_resource = 0;   pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER; // Thread function to modify shared resource void* inc_dec_resource(void* arg){     //get the pointer from main thread and dereference it…

CREATE DATABASE COUNTRIES; USE COUNTRIES; DROP TABLE IF EXISTS `City`; CREATE TABLE `City` ( `ID` int(11) NOT NULL AUTO_INCREMENT, `Name` char(35) NOT NULL DEFAULT '', `CountryCode` char(3) NOT NULL DEFAULT '', `District` char(20) NOT NULL DEFAULT '', `Population` int(11) NOT NULL DEFAULT '0', PRIMARY KEY (`ID`) ) ENGINE=MyISAM AUTO_INCREMENT=4080 DEFAULT CHARSET=latin1; -- -- Dumping data for table `City` -- -- ORDER BY: `ID` INSERT INTO `City` VALUES (1,'Kabul','AFG','Kabol',1780000); INSERT INTO `City` VALUES (2,'Qandahar','AFG','Qandahar',237500); INSERT INTO `City` VALUES (3,'Herat','AFG','Herat',186800); INSERT INTO `City` VALUES (4,'Mazar-e-Sharif','AFG','Balkh',127800); INSERT INTO `City` VALUES (5,'Amsterdam','NLD','Noord-Holland',731200); INSERT INTO `City` VALUES (6,'Rotterdam','NLD','Zuid-Holland',593321); INSERT INTO `City` VALUES (7,'Haag','NLD','Zuid-Holland',440900); INSERT INTO `City` VALUES (3068,'Berlin','DEU','Berliini',3386667); INSERT INTO `City` VALUES…

Complete the docstring using the information attached (images):def upgrade_stations(threshold: int, num_bikes: int,                     stations: List["Station"]) -> int:    """Modify each station in stations that has a capacity that is less than    threshold by adding num_bikes to the capacity and bikes available counts.    Modify each station at most once.     Return the total number of bikes that were added to the bike share network.     Precondition: num_bikes >= 0     >>> handout_copy = [HANDOUT_STATIONS[0][:], HANDOUT_STATIONS[1][:]]    >>> upgrade_stations(25, 5, handout_copy)    5    >>> handout_copy[0] == HANDOUT_STATIONS[0]    True    >>> handout_copy[1] == [7001, 'Lower Jarvis St SMART / The Esplanade', \                            43.647992, -79.370907, 20, 10, 10]    True    """

7. group_friends_by_food For this problem, you are given a mostly-working version of the Friend and FriendsDB classes from hw6 and hw7, and we will add new method to FriendsDB -- group_friends_by_food. group_friends_by_food returns a dictionary mapping from each of the favorite foods enjoyed by any friend to a list of the friends who enjoy that food, sorted in alphabetical order. (You can use the friends_who_love method to generate these lists.) A sample run should look like this: >>> friend1 = Friend("sarah", 165) >>> friend1.add favorite_food("strawberries") >>> friend2 Friend("dweezil", 175) >>> friend2.add_favorite_food("pizza") >>> friend3 Friend("bimmy", 60) >>> friend3.add_favorite_food("pizza") >>> friend3.add favorite_food ("strawberries") >>> db FriendsDB() %3D >>> db.add_ friend(friend1) >>> db.add_friend(friend2) >>> b.add_friend (friend3) >>> db.group_friends_by_food() {'strawberries': ['bimmy', 'sarah'], 'pizza': ['bimmy', 'dweezil']}

Create the same City Database that you created in the first question using Hash table. Add another attribute in the City record, that is, city_id. Use city_id to compute the hashing. Implment member functions to insert, delete, search and display city records. Use the chained hashing to resolve the collision issue. ------------------------------------------------------------------------- so here is my out put from the first question #include <iostream>#include <string>#include <cmath> using namespace std; struct city{string name;int x;int y;city *left;city *right;bool deleted;}; class database{private:city *root;void insert(city *&temp, string name, int x, int y){if(temp == NULL){temp = new city();temp->name = name;temp->x = x;temp->y = y;temp->left = NULL;temp->right = NULL;temp->deleted = false;}else{if(name < temp->name){insert(temp->left, name, x, y);}else if(name > temp->name){insert(temp->right, name, x,…