Develop code to implement the "Fake Sort" routine described below. • Given a list of numerical data, create a new list with the data from the original list sorted from minimum to maximum o We’ll call this "Fake Sort" because it’s cheating (a bit) to create a new list while destroying the original list o Here’s the basic algorithm  Find the minimum value in original list  Append value to the new list  Delete that element from original list  Repeat until run out of members in the original list o Now, write a routine to reverse the sorted list

Which is a benefit of peer-to-peer networking? easy to add or remove devices main server has a fast processor more reliable than a client/server network same software versions on all computers

Which component acts as a platform on which application software runs

Suppose a router has built up the routing table shown in the table. subnet number 128.96.39.00 28.96.39.128 128.96.40.00 192.4.153.0 default) subnet mask 255.255.255.128 255.255.255.128 255.255.255.128 255.255.255.192 nexthop interface 0 interface 1 r2 r3 r4. the router can deliver packets directly over interfaces 0 and 1, or it can forward packets to routers r2, r3, or r4. describe what the router does with a packet addressed to each of the following destinations: (a) 128.96.39.10 (b) 128.96.40.12 (c) 128.96.40.151 (d) 192.4.153.17 (e) 192.4.153.90