please look at my question !!!! for this nodejs router const http = require("http"); const url = require('url'); var hostName = '127.0.0.1'; var port = 3000; var server = http.createServer(function(req,res){ res.setHeader('Content-Type','text/plain'); const parsed = url.parse(req.url); const pathname = parsed['pathname'] const queryObject = url.parse(req.url,true).query; let queryValue = queryObject['name']if(queryValue==null){ queryValue="" } if (pathname=="/"){ res.end("SUCCESS!") } else if (pathname=="/echo"){ res.end("SUCCESS! echo") } else if (pathname=="/foxtrot/:name"){ queryValue = queryObject['name'].toString() res.end("SUCCESS! Received "+queryValue+" via foxtrot") } else{ res.end("FAILED! Fix your URL.") } }) server.listen(port,hostName,()=>{ console.log(`Server running at http://${hostName}:${port}/`); }); -------------- it runs like this picture i wnat to fix it ,when i run http://127.0.0.1:3000/foxtrot/kilo ,it should work and it shows "SUCCESS! Received kilo via foxtrot" how to change it ?

@Override// interface method ==================================================public int merge(BST nbt) {/*See BST.java for method specification */// Hint: traverse bst using pre-order// as each node is visited, take the value there// and do this.insert(value)// have to somehow count when an add is successful// so we can return the number of nodes added/* Your code here */return 0; // Dummy return statement. Remove when you implement!} in java  fill out method should merge two bst and not add duplicates

Code to implement a command-line search auto complete interface won't work, whats the problem?   #include <iostream> #include <fstream> #include <string> #include <vector>   const int ALPHABET_SIZE = 28;   class Trie { private: structTrieNode { //Node struct which contains a a child node for each letter of the alphabet TrieNode *children[ALPHABET_SIZE]; boolisEndOfWord;//bool to determine if letter is the last in a word   TrieNode() {//constructor to initially set every child node to empty, and bool to false for (int i = 0; i < ALPHABET_SIZE; i++) { children[i] = NULL; } isEndOfWord = false; }   ~TrieNode() {//deconstructor for (int i = 0; i < ALPHABET_SIZE; i++) { if (children[i] != NULL) { deletechildren[i]; } } } };   TrieNode *root;//pointer to point to first letter in word   public: Trie() { root = newTrieNode(); //new node is created for first letter inserted }   ~Trie() { deleteroot; }   //this function inserts every word in the dictionary to the…

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

In javascript: move the first <li> tag from the second <ol> tag to be the last <li> tag in the first <ol>.

Create an implementation of each LinkedList, Queue Stack interface provided For each implementation create a tester to verify the implementation of thatdata structure performs as expected Your task is to: Implement the LinkedList interface ( fill out the implementation shell). Put your implementation through its paces by exercising each of the methods in the test harness Create a client ( a class with a main ) ‘StagBusClient’ which builds a bus route by performing the following operations on your linked list: Create (insert) 4 stations List the stations Check if a station is in the list (print result) Check for a station that exists, and one that doesn’t Remove a station List the stations Add a station before another station. List the stations Add a station after another station. Print the stations StagBusClient.java package app;  import linkedList.LinkedList; import linkedList.LinkedListImpl; public class StagBusClient { public static void main(String[] args) { // create…

Question 15 Why does our node class have two versions of the link member function? One is public, the other is private. One is to use with a const pointer, the other with a regular pointer. One returns the forward link, the other returns the backward link. One returns the data, the other returns a pointer to the next node.

The following step is used to remove first node from the AVAIL list. NEW: =AVAIL AND AVAIL: =LINK[AVAIL] Select one: True False

Because a class may derive from a number of different interfaces, interfaces aid in the establishment of stronger is-a links. if anything is genuine or a fake

Homework #2 Q1: A set of LANS are linked using bridges to create the bridged network depicted by the figure bellow. The bridges communicate configuration BPDUS to build a spanning tree to prevent loops within the network. If all bridges start the spanning tree algorithm (all bridges are initialized), answer the following questions (assume that the circles in the figure are the bridges and the ID for each bridge is the number inside these circles. Also assume that the state of each bridge is changing in sequence according to the information in each question) B3 B5 B1 B2 F B7 B6 B4 a) What is the initial configuration BPDU for B6? b) What is the configuration BPDU of B2 after receiving the initial configuration BPDU of B7? c) If B3 accepted B2 as the root, what is the configuration BPDU of B3? d) If B3 accepted B1 as the root through B5, what is the configuration BPDU of B3? e) Which bridge is the designated bridge of LAN C at this time? f) Now, if B7 accepted B1 as the root, what is the…