The coupon collector problem calculates the expected number ofdays it takes to get n different coupons, if one receives one ofthe n coupons at random each day. The number of days isapproximately n(0.577 + ln n). Use this to calculate the expectednumber of TCP connections a random port scan (scanning port numbers0 through 1023) needs to eventually check all 1,024 well- knownport numbers.
Expert Answer
An answer will be send to you shortly. . . . .