Your program will allow Crossword objects to be created from $.$tex files that you can assume are stored

in the working directory, and whose contents satisfy all conditions spelled out in Section $2\mathrm{.}1.$ Making

use of the $.$tex files empty$\_$grid$\_1.$tex, empty$\_$grid$\_2.$tex, empty$\_$grid$\_3.$tex, partial$\_$grid$\_1.$tex,

partial$\_$grid$\_2.$tex and partial$\_$grid$\_3.$tex, having for associated $.$pdf files empty$\_$grid$\_1.$pdf$,$

empty$\_$grid$\_2.$pdf$,$ empty$\_$grid$\_3.$pdf$,$ partial$\_$grid$\_1.$pdf$,$ partial$\_$grid$\_2.$pdf and partial$\_$grid$\_3.$pdf$,$

here is a possible interaction.

Passing as argument to print$()$ a denotation of a Crossword object results in an output of the kind

A grid of width $\_$ and height $\_,$ with $\_$ black case$[$s$],$ filled with $\_$ letter$[$s$],$

with $\_$ complete vertical word$[$s$]$ and $\_$ complete horizontal word$[$s$].$

where

$$ the first occurrence of $\_$ is a number that represents the horizontal dimension of the grid,the second occurrence of $\_$ is a number that represents the vertical dimension of the grid,

$$ the third occurrence of $\_$ is no$,1$ or a number at least equal to $2$ that represents the number n of

black cases in the grid $($of course it is case if n $=1$ and cases otherwise$),$

$$ the fourth occurrence of $\_$ is no$,1$ or a number at least equal to $2$ that represents the number n of

letters alredy placed in the grid $($of course it is letter if n $=1$ and letters otherwise$),$

$$ the fifth occurrence of $\_$ is no$,1$ or a number at least equal to $2$ that represents the number n of

vertical words in the grid $($of course it is word if n $=1$ and words otherwise$),$ and

$$ the sixth occurrence of $\_$ is no$,1$ or a number at least equal to $2$ that represents the number n of

horizontal words in the grid $($of course it is word if n $=1$ and words otherwise$).$I just want to know the basic locgic about this question