1. Find the probability the student gets between 2 and 7, exclusive, questions correct.

2. Find the probability the student gets more than 6 questions correct.

Use a normal distribution to estimate the probability of more than 55 girls being born in 100 births. Assume that the probability of a girl being born in an individual birth is 50%.

Consider the probability that less than 14 out of 157 people have been in a car accident. Assume the probability that a given person has been in a car accident is 11%.

In a certain​ country, the true probability of a baby being a boy is 0.516 Among the next eight randomly selected births in the​ country, what is the probability that at least one of them is a girl?

the probability of getting a single pair in a poker hand of 5 cards is approximately .42. Find the approximate probability that out of 1000 poker hands there will be at least 450 with a single pair.

In a certain​ country, the true probability of a baby being a boy is 0.531. Among the next six randomly selected births in the​ country, what is the probability that at least one of them is a girl?

Python Knapsack Problem:

Acme Super Store is having a contest to give away shopping sprees to lucky families. If a family wins a shopping spree each person in the family can take any items in the store that he or she can carry out, however each person can only take one of each type of item. For example, one family member can take one television, one watch and one toaster, while another family member can take one television, one camera and one pair of shoes.

Each item has a price (in dollars) and a weight (in pounds) and each person in the family has a limit in the total weight they can carry. Two people cannot work together to carry an item. Your job is to help the families select items for each person to carry to maximize the total price of all items the family takes. Write an algorithm to determine the maximum total price of items for each family and the items that each family member should select.

***In python:***

Implement your algorithm by writing a program named “shopping.py”. The program should satisfy the specifications below.

Input: The input file named “shopping.txt” consists of T test cases

T (1 ≤ T ≤ 100) is given on the first line of the input file.

Each test case begins with a line containing a single integer number N that indicates the number of items (1 ≤ N ≤ 100) in that test case

Followed by N lines, each containing two integers: P and W. The first integer (1 ≤ P ≤ 5000) corresponds to the price of object and the second integer (1 ≤ W ≤ 100) corresponds to the weight of object.

The next line contains one integer (1 ≤ F ≤ 30) which is the number of people in that family.

The next F lines contains the maximum weight (1 ≤ M ≤ 200) that can be carried by the ith person in the family (1 ≤ i ≤ F).

Output: Written to a file named “results.txt”. For each test case your program should output the maximum total price of all goods that the family can carry out during their shopping spree and for each the family member, numbered 1 ≤ i ≤ F, list the item numbers 1 ≤ N ≤ 100 that they should select.

Sample Input:

2

3

72 17

44 23

31 24

1

26

6

64 26

85 22

52 4

99 18

39 13

54 9

4

23

20

20

36

Sample Output:

Test Case 1

Total Price 72

Member Items

1: 1

Test Case 2

Total Price 568

Member Items

1: 3 4

2: 3 6

3: 3 6

4: 3 4 6