Slove the Problem:
the matching section of an exam has 5 questions and 8 possible answers in how many different ways can a student answer the 5 question, if none of the answer choices can be repeated?