Describe a linear time algorithm (i. e. O(n)) which finds the minimum Taxicab Geometry or rectilinear metric containing given n points in rectilinear plane. Hint: A rectilinear disk is a square (90 degrees rotated) You need to find a 90 deg rotated minimum square containing all points

Install and use wireshark program ( send back screen shots and other vital information) case project 3-2: decode a tcp segment in a wireshark capture in this chapter, you walked through tcp segment to interpret the data included in its header. in this project, you use wireshark to capture your own http messafes, examine the tcp headers, and practice interpreting the data you'll find there. 1. open wireshark and snap the window to one side of your screen. open a browser and snap that window to the other side of your screen so you can see both windows.