Task $2-[60$pts$]$

Be careful of copy paste, and using solution from external resources, if so$,$ you will receive a score of ZERO.

Instructions:

$1.$Implement the Depth$-$First Search $($DFS$)$ algorithm in Java to traverse a binary tree data structure.

$2.$Draw a binary tree structure based on the given integer nodes $(10$ nodes$),$ assume they are inserted in the

following order $($left to write$)$: $5,3,8,2,4,7,9,1,6,10$

$3.$Execute your implemented DFS code with the provided binary tree example.

$4.$Capture screenshots at different stages of the traversal process to demonstrate the traversal path.

$5.$Include the screenshots along with your implementation.