You were selected to design a small peer-to-peer network for a new facility which has six computers and a networked printer. Each desk computer must have a wired network connection. The rooms are to have wireless access for mobile devices.For this assignment, you will utilize Gliffy®, (Links to an external site.) a software application to create a basic network diagram depicting a star topology with a switch as the central communications node. The focus here is on the network communications equipment for this LAN. Include only that equipment and end node devices on the network diagram. There is no need to draw out the layout of the physical space.In addition to providing a network diagram, you must also provide a short essay that describes the details of the LAN equipment that is being used and the connections. In the essay, be sure to explain why each device is positioned where it is.Also, briefly state any assumptions you've made about the kind of work being done, the demands the personnel in the office will put on the network, how they'll use it, and how that influenced your design. For example, if the business that uses the LAN is a small video-based news streaming service, they will probably need more performance from both their network and ISP than a small rental property management office might need.Depict a star topology that uses Ethernet.Provide a 'cloud' shape or another symbol for the ISP WAN service. Label the symbol as 'Dial-up,' 'Cable,' or 'Fiber Optic.'Label all network devices in the LAN (brand and model names are acceptable but not required).Connect to the ISP service using a dial-up modem, cable modem, or, if using fiber optic service, an optical network terminal (ONT). Do not use a combination device such as a modem/router.Connect the LAN router (wireless router) to the ISP WAN service device. The LAN router provides many capabilities to include: DHCP, (Links to an external site.) NAT translation, (Links to an external site.) port forwarding, (Links to an external site.) QoS, (Links to an external site.) and software firewall services. Do not use a router/switch combination device; however, a router with integrated wireless capabilities is acceptable.Use a managed switch as a centrally-located device to provide wired network connectivity for the seven end nodes (six desktop computers and a printer). Connect the switch directly to the main LAN router.Connect the seven end nodes directly to the central switch.Label the specific type of physical media (cables) being used to connect the LAN router to the ISP service device, the central switch to the LAN router, and the seven end nodes to the central switch.Use a screen capture tool such as Snagit (Links to an external site.) or the Microsoft Clipping Tool to copy your diagram and paste the copied image into a Word document with the written essay.Optional:Provide a separate network firewall hardware device in your diagram. Locate the firewall between the ISP WAN device and the LAN router.To alleviate some of the workloads placed on the LAN router, you could disable the wireless functionality of the LAN router and provide a separate Wireless Access Point (WAP) to provide wireless network access for the mobile devices (e.g., cell phones, iPads, etc.).Connecting the Wireless Access Point (WAP) directly to the primary router will enable isolation of the wireless LAN (WLAN).

InstructionsTasksUsing Microsoft Word add 3- to 4-pages to it by completing the following tasks:Describe the type of system support and maintenance that you should provide, either through live help or with built-in features such as auto-updaters and self-diagnosing systems.Discuss a conversion strategy you would set in place for the time you decide to issue a new version of the application.Discuss a business contingency plan you would set in place for the time you decide to issue a new version of the application.Submission Details:Support your responses with appropriate research and examples.Cite any sources in APA format.Name your document SU_ITS4090_W5_PP5_LastName_FirstInitial.doc.

I'm working on a algorithms & data structures project and need a reference to help me learn.The language used for this project is C++Also I thank anyone attempting this, this is the reality of inexperienced professors that put us students through so much. Please help me if you can. Thank you so much, very much appreciated.you will develop algorithms that find road routes through the bridges to travel between islands.The input is a text file containing data about the given map. Each file begins with the number of rows and columns in the map considered as maximum latitudes and maximum longitudes respectively on the map. The character "X" in the file represents the water that means if a cell contains "X" then the traveler is not allowed to occupy that cell as this car is not drivable on water. The character "0" in the file represents the road connected island. That means if a cell contains "0" then the traveler is allowed to occupy that cell as this car can drive on roads. The traveler starts at the island located at latitude = 0 and longitude = 0 (i.e., (0,0)) in the upper left corner, and the goal is to drive to the island located at (MaxLattitude-1, MaxLongitudes-1) in the lower right corner. A legal move from an island is to move left, right, up, or down to an immediately adjacent cell that has road connectivity which means a cell that contains "0". Moving off any edge of the map is not allowed.Print paths as explicitly specified for all the functions in Part A, Part B, and extra credit on the console. Input: The map filesOutput: Print paths as explicitly specified for all the functions in Part A, Part B, and extra credit on the console. Part AConsider the following class map,class map{public:map(ifstream &fin);void print(int,int,int,int);bool isLegal(int i, int j);void setMap(int i, int j, int n);int getMap(int i, int j) const;int getReverseMapI(int n) const;int getReverseMapJ(int n) const;void mapToGraph(graph &g);bool findPathRecursive(graph &g, stack<int> &moves);bool findPathNonRecursive1(graph &g, stack<int> &moves);bool findPathNonRecursive2(graph &g, queue<int> &moves);bool findShortestPath1(graph &g, stack<int> &bestMoves);bool findShortestPath2(graph &, vector<int> &bestMoves);void map::printPath(stack<int> &s);int numRows(){return rows;};int numCols(){return cols;};private:int rows; // number of latitudes/rows in the mapint cols; // number of longitudes/columns in the mapmatrix<bool> value;matrix<int> mapping; // Mapping from latitude and longitude co-ordinates (i,j) values to node index valuesvector<int> reverseMapI; // Mapping from node index values to map latitude i valuevector<int> reverseMapJ; // Mapping from node index values to map longitude j value};1. Using the above class map, write function void map::mapToGraph(graph &g){...} to createe a graph g that represents the legal moves in the map m. Each vertex should represent a cell, and each edge should represent a legal move between adjacent cells.2. Writee a recursive function findPathRecursive(graph &g, stack<int> &moves) that looks for a path from the start island to the destination island. If a path from the start to the destination exists, your function should call the map::printPath() function that should print a sequence of correct moves (Go left, Go right, Go down, Go up, etc.). If no path from the start to the destination exists, the program should print, "No path exists". If a solution exists the solver should also simulate the solution to each map by calling the map::print() function. Hint: consider recursive-DFS.3. Writee a function findPathNonRecursive1(graph &g, stack<int> &moves) that does the same thing as in 2, but by using stack and without using recursion. If a path from the start to the destination exists, your function should call the map::printPath() function that should print a sequence of correct moves (Go left, Go right, Go down, Go up, etc.). If no path from the start to the destination exists, the program should print, "No path exists". If a solution exists the solver should also simulate the solution to each map by calling the map::print() function. Hint: consider stack-based DFS.4. Writee a function findPathNonRecursive2(graph &g, queue<int> &moves) that does the same thing as in 2, but by using queue and without using recursion. If a path from the start to the destination exists, your function should call the map::printPath() function that should print a sequence of correct moves (Go left, Go right, Go down, Go up, etc.). If no path from the start to the destination exists, the program should print, "No path exists". If a solution exists the solver should also simulate the solution to each map by calling the map::print() function. Hint: consider queue-based BFS.Part BThe shortest path on a map is a path from the start to the destination with the smallest number of intermediate islands, that is the path with the least number of intermediate "0".1. Write two functions findShortestPath1(graph &g, stack<int> &bestMoves) and findShortestPath2(graph &g, stack<int> &bestMoves) that each finds the shortest path on a map if a path from the start to the destination exists. The first algorithm should use Dijkstra algorithm and the second algorithm should use Bellman-Ford algorithm to find the shortest paths. In each case, if a solution exists the solver should call the map::printPath() function that should print a sequence of correct moves (Go left, Go right, Go down, Go up, etc.). If no path from the start to the destination exists, the program should print, "No path exists". If a solution exists the solver should also simulate the solution to each map by calling the map::print() function. Each function should return true if any paths are found, and false otherwise..pdf file | C++-