can some help me with this question?

1. Write a Java program that generates random text string with a length of 300 bytes for 250.000 iterations. For each iteration, reverse the string using: a) String operations, and b) StringBuilder operations. Then c) What is the running time complexity of (a) and (b) after all iterations? d) Present your results in (c) as a graph showing the running times