Java

Answer The big-O notation is O). 42. For the following T(n), find values of n, and c such that cn is larger than T(n) for all n larger than no (Please demonstrate how you get the result and prove it) 43. If a loop processes n items and n changes from 1024 to 2048, how does that affect the running time of a loop that is O(n2)? How about O(n3)? Draw a single-linked list of String objects containing the Strings "Peter "Angela", " Mary" and "Harry" and referenced by head Complete the following fragment, which adds all String objects in a list. Your fragment should walk down the list, connecting all String values to combinedString. The Node defined as an inner class which has two fields: data and next. The data field stores that data values and the next field is a reference to the next node. For example, e Node String data, Node next) t Answer The big-O notation is O). 42. For the following T(n), find values of n, and c such that cn is larger than T(n) for all n larger than no (Please demonstrate how you get the result and prove it) 43. If a loop processes n items and n changes from 1024 to 2048, how does that affect the running time of a loop that is O(n2)? How about O(n3)? Draw a single-linked list of String objects containing the Strings "Peter "Angela", " Mary" and "Harry" and referenced by head Complete the following fragment, which adds all String objects in a list. Your fragment should walk down the list, connecting all String values to combinedString. The Node defined as an inner class which has two fields: data and next. The data field stores that data values and the next field is a reference to the next node. For example, e Node String data, Node next) t