Consider two types of ADJ problems: selecting a data structure $($design can be as simple as making a choice$),$ or developing an algorithm $($design is a pseudocode outline$).$ In a selection type problem, justification can be done by discussing the different options available, but in an algorithmic problem, the justification typically looks like trying to argue that the design is the "best". Why can't an algorithmic ADJ problem take the "different options available" approach?