Suppose item i appears exactly s times in a file of n baskets, where s is the support threshold. If we take a sample of n/100 baskets, and lower the support threshold for the sample to s/100, what is the probability that i will be found to be frequent? You may assume that both s and n are divisible by 100.

Note!! The solution is not supposed to be submitted as a code. This is question 6.4.3 from Mining of Massive Datasets textbook by Jure Leskovec et all.