6. What is the error in the following program segment. Explain in detail what will happen if it is not fixed? #include using nanespace std; void naino f etruct linkl int info; link next; link *top, *curr, prev. *ptr; int ival; A ?issing segment of code builds a linked list with top as a pointer to the top. cin ival; prev 0; curr - top while(curr &curr->info- ival)f prev curr; curr = curr->next; } if (eurr) prev-next curr-next; delete curr