Implement a Java program that applies the Newton-Raphson's method x_n+1 = x_n f(x_n) / f '(x_n) to search the roots for this polynomial function 9x⁶ 8x⁵ + 7x⁴ 6x³+ 5x² 4x + 3 = 0. The program terminates when the difference between the new solution and the previous one is smaller than 0.00001 within 2000 iterations. Otherwise, it shows Not Found as the final solution.

Your teams goal is to find as many roots as possible. For the Newton-Raphsons method, you will need to start with a guessed x₀ value which can be randomly generated. List out each guessed x₀ value, the derived root, the number of iteration for finding the root, and the value of the polynomial function by plugging in the root.