There are n students with unique ID's let's say 1, 2, 3, ..., n. Let us...

 

Transcribed Image Text:

There are n students with unique ID's let's say 1, 2, 3, ..., n. Let us assume that n₁ students (n₁ <n) are taking the Artificial Intelligence (Al) class, n₂ students (n₂<n) are taking the Machine Learning (ML) class, and n3 students (n3≤n) are taking the Algorithm Design (AD) class. The arrays Al [1, 2, ... n₁], ML [1,2,.....n₂], and AD[1,2.....3] contain the ID's of the students in each class, listed in arbitrary order. Use pseudocode to design an algorithm PRINT-STUDENT-CLASSES(AI, ML, AD, n₁, n₂, ng, n) which for each student ID prints the classes the student is taking. The RT for the algorithm must be O(nlog2n). Use the pseudocode conventions from the notes/textbook. There are n students with unique ID's let's say 1, 2, 3, ..., n. Let us assume that n₁ students (n₁ <n) are taking the Artificial Intelligence (Al) class, n₂ students (n₂<n) are taking the Machine Learning (ML) class, and n3 students (n3≤n) are taking the Algorithm Design (AD) class. The arrays Al [1, 2, ... n₁], ML [1,2,.....n₂], and AD[1,2.....3] contain the ID's of the students in each class, listed in arbitrary order. Use pseudocode to design an algorithm PRINT-STUDENT-CLASSES(AI, ML, AD, n₁, n₂, ng, n) which for each student ID prints the classes the student is taking. The RT for the algorithm must be O(nlog2n). Use the pseudocode conventions from the notes/textbook.