Seeds of type A and type B are sold in a packet each must contain

a)both type a and type b seeds
b)at least twice the number of type b c)as there are type a seeds
no more thanm 12 seeds
1)state the minimum number in each packet of type a and type b seeds.

2)if there are x type a and y type b seeds in eack packet write (4) inequalities to represent the above conditions.

3)using a scale of 1 cm for each unit on both axes draw a graph on the same axes to represent the inequalities

We can't draw graphs here. I answered the other parts of this question several days ago. This is the third time I have seen it posted. Perhaps someone else will offer you a clearer explanation.

1) To find the minimum number of seeds in each packet of type A and type B, we need to satisfy all the given conditions. Let's go through each condition:

a) Both type A and type B seeds should be present in each packet. This means the minimum number of type A and type B seeds in each packet should be 1.

b) The number of type B seeds should be at least twice the number of type A seeds. So, the minimum number of type B seeds should be 2 times the number of type A seeds.

c) The total number of seeds in each packet should not exceed 12. Thus, we have the condition: (Number of type A seeds) + (Number of type B seeds) ≤ 12.

2) Now, let's write the inequalities to represent the conditions described:

a) Both type A and type B seeds should be present in each packet:
(Number of type A seeds) ≥ 1
(Number of type B seeds) ≥ 1

b) The number of type B seeds should be at least twice the number of type A seeds:
(Number of type B seeds) ≥ 2 * (Number of type A seeds)

c) The total number of seeds in each packet should not exceed 12:
(Number of type A seeds) + (Number of type B seeds) ≤ 12

3) To graphically represent the inequalities, we can plot the values of (Number of type A seeds) on the x-axis and (Number of type B seeds) on the y-axis.

Let's create a table with some sample values to plot the graph:

| Number of type A seeds | Number of type B seeds |
|-----------------------|-----------------------|
| 1 | 2 |
| 2 | 4 |
| 3 | 6 |
| 4 | 8 |
| 5 | 10 |
| 6 | 12 |

Now, plot these points on the graph with the x-axis representing the number of type A seeds and the y-axis representing the number of type B seeds. Connect the dots to form a graph.

Note that the graph will be a combination of shaded and unshaded regions, depending on which side of the inequalities the points lie.

This graph will represent the feasible solutions for the minimum number of type A and type B seeds in each packet, satisfying all the given conditions.