The problem describes a scenario where one member out of twelve is randomly selected each month to host a dinner. Since the selection process is by picking lots, it implies a random selection each month. There is no guarantee that any particular member will be chosen, nor is there a mechanism to ensure everyone hosts an equal number of times within a year. Therefore, the number of dinners a specific member has to host cannot be predetermined.