What is the initial capacity of the HashMap when no size is defined, and how is it related to the number of entries it can ideally accommodate without resizing?

In Java, when you create a HashMap without specifying an initial capacity, it defaults to an initial capacity of 16. This means that initially, the HashMap can accommodate 16 key-value pairs. However, as the number of entries increases and reaches a certain threshold (usually 75% of the capacity), the HashMap automatically resizes itself, doubling its capacity. So, option (a) is correct, with the explanation that it can ideally accommodate 16 entries initially but will resize when necessary.