There are n courses labeled 0 to n-1 and a list of prerequisite pairs. Given a list of queries where queries[i] = [u, v], for each query return true if course u is a prerequisite of course v (directly or transitively), otherwise false.

Example 1:

Input: n = 2, prerequisites = [[1,0]], queries = [[0,1],[1,0]]
Output: [false, true]

Example 2:

Input: n = 3, prerequisites = [[1,2],[1,0],[2,0]], queries = [[1,0],[1,2]]
Output: [true, true]

Constraints:

• 2 <= n <= 100
• 0 <= prerequisite.length <= n*(n-1)/2
• 1 <= queries.length <= 10^4