Given a relation: Courses (C_No, C_Name, Program_ID, prerequ…

Given a relation: Courses (C_No, C_Name, Program_ID, prerequisite, syllabus). The data file contains 800 pages and each page contains 50 tuples. Suppose there is a B+tree index on Program_ID and it is unclustered. There are 10 different Program_ID stored in the table and uniform distribution is assumed for the values. The index file contains 10 pages. Given the query: Select C_Name from Courses where Program_ID=”CSCI”, which of the query plan is more efficient?