## Convex Polygons

Let \(D\) be the set of all lattice points \((x,y)\) in the plane such that both \(x\) and \(y\) are positive integers less than \(10\). We are looking for polygons whose vertices are chosen from \(D\).

Part A | How many triangles have all their vertices chosen from \(D\)? | |
---|---|---|

Part B | How many convex quadrilaterals have all their vertices chosen from \(D\)? |