Pointers and Linked Lists: Linked Lists #include current=top; while(current!=NULL) { cout<data<<" " current=current->next; } cout<data=.1; for (i=2;i<=10;i++) { current ->next%3Dnew node; current=current->next; current ->data=i/10.0; } current ->next=NULL; This makes sure the list is NULL terminated. ; output: 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 This NULL terminates the list. Now you can write a program that creates a linked list with 26 nodes, fills them with the letters of the alphabet, and then prints them. Use three separate loops: one for creating one for filling, and one for printing, Make sure the last node points to NULL.

What information is included in the header?

Which of the following regarding R-values in C++17 is/are true? Select all that apply. Pick ONE OR MORE options Integer literals and string literals are both natively R-values An R-value can be passed to a function that accepts a constant L-value reference, but not to a function that accepts a non-constant L-value reference Any time two ampersands (&&) appear in syntactically valid C++17 code, they indicate the presence of an R-value reference For a given type ~T~, constructing an instance of ~T~ from an R-value reference is always strictly more efficient than constructing an instance of ~T~ from an L-value reference It is possible to restrict a class's custom call operator such that it may only be used on instances of the type that are R- value references

Please us c++ to make the code thank you very much!