Q$2.$ Write a Java program $($use JDBC to connect to the database$)$ that implements the following function $($written in pseudo code$)$ that prints out the subparts of a part using a depth$-$first search, and the branch with a smaller part number will be searched first $($where there is more than one branch$)$

In the above question the basic problem is $-$ we need to $$explode$$ the given

part to n levels, but we don$$t know the value of n$.$ Now, SQL introduces the ability to write recursive expressions. Please formulate the query using that feature and test it with Postgresql. The output sequence does not have to follow the exact same order as that required by Q$\mathrm{.}2/$Assignment #$2$