In the field of Computer Science, the classification of the star-search problem as NP-complete is demonstrated by:
a) Reducing a known NP-complete problem to the star-search problem.
b) Proving that the star-search problem belongs to the P complexity class.
c) Finding an efficient algorithm that solves the star-search problem in polynomial time.
d) Showing that the star-search problem only applies to specific instances, hence not NP-complete.