backtracking algorithm to place the points [leftx[rightx[ [left- and [right+ [nalready tentatively placed if place returns truethen [leftx[rightwill have values *bool placevector xdistset dint nint leftint right int dmaxbool found false ifd isemptyreturn true dmax findmax) /check if setting [rightdmax is feasible ifx[jdmax for all <= <left and right< <= [rightdmax/try [right]=dmax for <= <leftright< <= removex[jdmax )found placexdnleftright- ) if!found /backtrack for <= <leftright< <= /undo the deletion insertx[jdmax ) /if first attempt failedtry to see if setting / [left]= [ ]-dmax is feasible if!found & [ndmax [jd for all <= <left and right< <= [leftx[ndmax/same logic as before for <= <leftright< <= removex[ndmax [ )found placexdnleft+ right ) if!found /backtrack for <= <leftright< <= /undo the deletion insertx[ndmax [ ) return foundfigure turnpike reconstruction algorithmbacktracking steps (pseudocode